| Graph Isomorphism Network |
🌲 |
2025-07-21 |
2025-03-03 |
| graph homomorphism |
🌲 |
2025-07-21 |
2025-03-03 |
| graph motif |
🪴 |
2025-07-21 |
2025-03-24 |
| graphon fourier transform |
🌲 |
2025-07-21 |
2025-04-02 |
| graphon shift operator |
🌲 |
2025-07-21 |
2025-03-31 |
| graphon shift operators are self-adjoint |
🌲 |
2025-07-21 |
2025-03-31 |
| graphon signal |
🪴 |
2025-07-21 |
2025-03-26 |
| graphon |
🪴 |
2025-07-21 |
2025-03-24 |
| inverse image of infinity of measurable functions is measurable |
🌲 |
2025-07-21 |
2025-07-14 |
| lipschitz graph convolutions of graph signals converge to lipschitz graphon filters |
🌲 |
2025-07-21 |
2025-04-15 |
| spectral representation of graphon convolutions |
🌲 |
2025-07-21 |
2025-04-09 |
| Baire Category Theorem |
🌲 |
2025-07-15 |
2025-06-05 |
| convergence bound for graph convolutions |
🌲 |
2025-07-15 |
2025-04-22 |
| convergent graph sequence |
🌲 |
2025-07-15 |
2025-03-24 |
| maximal orthonormal set |
🌲 |
2025-07-15 |
2025-07-15 |
| orthonormal basis of a hilbert space |
🌲 |
2025-07-15 |
2025-07-15 |
| uniform boundedness theorem |
🌲 |
2025-07-15 |
2025-06-05 |
| Cesaro-Fourier mean |
🌲 |
2025-07-15 |
2025-07-15 |
| fourier partial sums are given by the Dirichlet kernel |
🌲 |
2025-07-15 |
2025-07-15 |
| Fourier series |
🌲 |
2025-07-15 |
2025-07-15 |
| Fourier coefficient |
🌲 |
2025-07-15 |
2025-07-15 |
| fourier functions form an orthonormal set |
🌲 |
2025-07-15 |
2025-07-15 |
| separable Hilbert spaces are bijective with ell-2 |
🌲 |
2025-07-15 |
2025-07-15 |
| Parseval's identity |
🌲 |
2025-07-15 |
2025-07-15 |
| all elements of hilbert spaces with orthonormal bases can be written as sums of the basis elements |
🌲 |
2025-07-15 |
2025-07-15 |
| Fatou's Lemma |
🌲 |
2025-07-14 |
2025-07-14 |
| changing measurable functions on a measure zero set preserves measurability |
🌲 |
2025-07-14 |
2025-07-14 |
| continuous functions are measurable |
🌲 |
2025-07-14 |
2025-07-14 |
| convergent sequence of simple functions for a measurable function |
🌲 |
2025-07-14 |
2025-07-14 |
| function relations almost everywhere hold in the integral |
🌲 |
2025-07-14 |
2025-07-14 |
| functions with finite integrals map a measure zero set to infinity |
🌲 |
2025-07-14 |
2025-07-14 |
| integral is 0 if and only if the function is 0 almost everywhere |
🌲 |
2025-07-14 |
2025-07-14 |
| integral of sum of a sequence is sum of the integrals |
🌲 |
2025-07-14 |
2025-07-14 |
| inverse image of measurable functions of all borel sets are measurable |
🌲 |
2025-07-14 |
2025-07-08 |
| it is only interesting to take integrals of functions with positive measure |
🌲 |
2025-07-14 |
2025-07-14 |
| lebesgue integral of sum is sum of the integral |
🌲 |
2025-07-14 |
2025-07-14 |
| lebesgue measurable |
🌲 |
2025-07-14 |
2025-06-17 |
| measurable function |
🌲 |
2025-07-14 |
2025-07-08 |
| nonnegative measurable functions |
🌲 |
2025-07-14 |
2025-07-14 |
| sets of measure zero do not affect the integral |
🌲 |
2025-07-14 |
2025-07-14 |
| simple function |
🌲 |
2025-07-14 |
2025-07-14 |
| simple functions are measurable |
🌲 |
2025-07-14 |
2025-07-14 |
| simple functions can be written as a finite complex linear combination of indicator functions |
🌲 |
2025-07-14 |
2025-07-14 |
| sums and products of measurable functions are measurable |
🌲 |
2025-07-14 |
2025-07-14 |
| sums and products of simple functions are simple functions |
🌲 |
2025-07-14 |
2025-07-14 |
| sups and infs of measurable functions are measurable |
🌲 |
2025-07-14 |
2025-07-14 |
| the limit of a convergent sequence of measurable functions is measurable |
🌲 |
2025-07-14 |
2025-07-14 |
| c band cardinality |
🌲 |
2025-07-09 |
2025-04-22 |
| Lebesgue measure |
🌲 |
2025-07-08 |
2025-06-17 |
| algebras have closure under finite disjoint countable unions |
🌲 |
2025-07-08 |
2025-07-08 |
| all borel sets are measurable |
🌲 |
2025-07-08 |
2025-07-08 |
| countable sets have outer measure zero |
🌲 |
2025-07-08 |
2025-06-17 |
| desirable properties for measure |
🌲 |
2025-07-08 |
2025-07-01 |
| equivalent intervals of measurability for measurable functions |
🌲 |
2025-07-08 |
2025-07-08 |
| measurable sets form a sigma algebra |
🌲 |
2025-07-08 |
2025-07-08 |
| measure of finite disjoint measurable sets is the sum of the measures |
🌲 |
2025-07-08 |
2025-07-08 |
| measure of union of nested sets converges to measure of limiting set |
🌲 |
2025-07-08 |
2025-07-08 |
| measure satisfies countable additivity |
🌲 |
2025-07-08 |
2025-07-08 |
| open intervals with upper bound infinity are measurable |
🌲 |
2025-07-08 |
2025-07-08 |
| outer measure has countable subadditivity |
🌲 |
2025-07-08 |
2025-07-01 |
| outer measure of subsets are bounded by their supersets |
🌲 |
2025-07-08 |
2025-07-01 |
| unions of measurable sets are measurable |
🌲 |
2025-07-08 |
2025-07-01 |
| template graph |
🌲 |
2025-07-03 |
2025-03-26 |
| algebra |
🌲 |
2025-07-01 |
2025-07-01 |
| corollary of Hahn-Banach |
🌲 |
2025-07-01 |
2025-06-12 |
| every vector space has a hamel basis |
🌲 |
2025-07-01 |
2025-07-01 |
| outer measure zero sets are measurable |
🌲 |
2025-07-01 |
2025-07-01 |
| sigma-algebra |
🌲 |
2025-07-01 |
2025-07-01 |
| the outer measure of an interval is its length |
🌲 |
2025-07-01 |
2025-07-01 |
| we can always extend functions on subspaces |
🌲 |
2025-07-01 |
2025-07-01 |
| we can always find an open set with outer measure slightly more |
🌲 |
2025-07-01 |
2025-07-01 |
| eigenfunction |
🌲 |
2025-06-30 |
2025-03-31 |
| fixed coefficients yield the same spectral response for both graphon and graph convolutions |
🌲 |
2025-06-30 |
2025-04-09 |
| we can write a graphon in the basis of its shift operator |
🌲 |
2025-06-17 |
2025-04-01 |
| cut distance |
🪴 |
2025-06-12 |
2025-03-24 |
| double dual |
🌲 |
2025-06-12 |
2025-06-12 |
| isometric |
🌲 |
2025-06-12 |
2025-06-12 |
| reflexive banach space |
🌲 |
2025-06-12 |
2025-06-12 |
| the functional to the double dual is isometric |
🌲 |
2025-06-12 |
2025-06-12 |
| Chebyshev Polynomial |
🌲 |
2025-06-11 |
2025-02-17 |
| Hamel basis |
🌲 |
2025-06-10 |
2025-06-05 |
| Zorn's lemma |
🌲 |
2025-06-10 |
2025-06-05 |
| Banach space |
🌲 |
2025-06-09 |
2025-05-27 |
| Convergence in the cut norm implies convergence in L2 |
🌲 |
2025-06-09 |
2025-03-26 |
| Davis-Kahan Theorem |
🌲 |
2025-06-09 |
2025-04-09 |
| GCN layers can be written as graph convolutions |
🌲 |
2025-06-09 |
2025-02-20 |
| GINs are maximally powerful for anonymous input graphs |
🪴 |
2025-06-09 |
2025-03-03 |
| GNNs inherit stability from their layers |
🌲 |
2025-06-09 |
2025-03-12 |
| GNNs perform better than their constituent filters |
🌲 |
2025-06-09 |
2025-03-12 |
| Graph Neural Networks |
🌲 |
2025-06-09 |
2025-02-05 |
| Hilbert-Schmidt integral operator |
🌱 |
2025-06-09 |
2025-03-31 |
| Lipschitz continuous |
🌲 |
2025-06-09 |
2025-03-05 |
| Lipschitz filters are stable to additive perturbations |
🌲 |
2025-06-09 |
2025-03-10 |
| MPNNs can be expressed as graph convolutions |
🌲 |
2025-06-09 |
2025-02-18 |
| We can verify whether graphs without node features and different laplacian eigenvalues are not isomorphic |
🌲 |
2025-06-09 |
2025-02-21 |
| Weisfeiler-Leman Graph Isomorphism Test |
🌲 |
2025-06-09 |
2025-02-21 |
| absolutely summable series have Cauchy partial sums |
🌲 |
2025-06-09 |
2025-05-29 |
| aggregation readout layer |
🌲 |
2025-06-09 |
2025-02-21 |
| almost exact recovery is impossible when the signal to noise ratio is less than the threshold |
🌲 |
2025-06-09 |
2025-02-10 |
| analytic function |
🪴 |
2025-06-09 |
2025-02-03 |
| approximation of heaviside functions using convolutional graph filters |
🌲 |
2025-06-09 |
2025-02-04 |
| balanced stochastic block model |
🌲 |
2025-06-09 |
2025-02-10 |
| banach spaces have all absolutely summable series are summable |
🌲 |
2025-06-09 |
2025-05-29 |
| bandlimited convergent graph signals converge in the fourier domain |
🌲 |
2025-06-09 |
2025-04-09 |
| bandlimited graphon signal |
🌲 |
2025-06-09 |
2025-04-09 |
| bijective bounded linear operators have bounded linear inverses |
🌲 |
2025-06-09 |
2025-06-05 |
| bounded linear operator space is banach |
🌲 |
2025-06-09 |
2025-05-30 |
| c eigenvalue margin |
🌲 |
2025-06-09 |
2025-04-22 |
| chain |
🌲 |
2025-06-09 |
2025-06-05 |
| chebyshev equioscillation theorem |
🌲 |
2025-06-09 |
2025-02-20 |
| chebyshev polynomials are orthogonal |
🌲 |
2025-06-09 |
2025-02-20 |
| closed graph theorem |
🌲 |
2025-06-09 |
2025-06-05 |
| closed subspaces of banach spaces are banach |
🌲 |
2025-06-09 |
2025-06-05 |
| color refinement algorithm |
🌲 |
2025-06-09 |
2025-02-21 |
| complete metric spaces have banach continuous bounded function spaces |
🌲 |
2025-06-09 |
2025-05-27 |
| compressed sparse row representation |
🌲 |
2025-06-09 |
2025-02-12 |
| computational graph |
🌲 |
2025-06-09 |
2025-03-03 |
| conditions for finding a convolutional graph filter |
🌲 |
2025-06-09 |
2025-01-29 |
| contextual stochastic block model |
🌲 |
2025-06-09 |
2025-02-12 |
| continuous bounded function space |
🌲 |
2025-06-09 |
2025-05-27 |
| continuous map |
🌲 |
2025-06-09 |
2025-05-29 |
| convergence in L-p implies convergence in cut norm |
🌲 |
2025-06-09 |
2025-03-26 |
| convolutional filter bank |
🌲 |
2025-06-09 |
2025-02-05 |
| convolutional graph filters are local |
🌲 |
2025-06-09 |
2025-01-29 |
| convolutional graph filters are permutation equivariant |
🌲 |
2025-06-09 |
2025-01-29 |
| convolutional graph filters are shift equivariant |
🌲 |
2025-06-09 |
2025-01-29 |
| coordinate representation |
🌲 |
2025-06-09 |
2025-02-12 |
| cut norm |
🪴 |
2025-06-09 |
2025-03-24 |
| cycle homomorphism density is given by the trace of the adjacency matrix |
🌲 |
2025-06-09 |
2025-03-04 |
| discriminability of a graph filter |
🪴 |
2025-06-09 |
2025-03-10 |
| distance |
🌲 |
2025-06-09 |
2025-03-24 |
| eigenvalues of the induced graphon converge pointwise to the eigenvalues of the limit |
🌲 |
2025-06-09 |
2025-04-02 |
| eigenvector misalignment |
🌲 |
2025-06-09 |
2025-03-10 |
| equivalence relation |
🌲 |
2025-06-09 |
2025-06-05 |
| equivariant |
🌲 |
2025-06-09 |
2025-01-30 |
| feature-aware spectral embeddings |
🌲 |
2025-06-09 |
2025-02-12 |
| filter permutation invariance |
🌲 |
2025-06-09 |
2025-03-10 |
| finite vector space |
🌲 |
2025-06-09 |
2025-05-27 |
| fully connected readout layer |
🌲 |
2025-06-09 |
2025-02-19 |
| fully random graph |
🌲 |
2025-06-09 |
2025-03-26 |
| fully random graphs converge to the graphon in probability |
🌲 |
2025-06-09 |
2025-03-26 |
| graph SAGE |
🌲 |
2025-06-09 |
2025-02-20 |
| graph attention model |
🌲 |
2025-06-09 |
2025-02-19 |
| graph automorphism |
🌲 |
2025-06-09 |
2025-03-05 |
| graph convolution |
🌲 |
2025-06-09 |
2025-01-29 |
| graph convolutional network |
🌲 |
2025-06-09 |
2025-02-20 |
| graph convolutions are stable to perturbations in the data and coefficients |
🌲 |
2025-06-09 |
2025-03-05 |
| graph edit distance |
🌲 |
2025-06-09 |
2025-03-24 |
| graph isomorphism is not solvable in polynomial time |
🪴 |
2025-06-09 |
2025-03-02 |
| graph isomorphism |
🌲 |
2025-06-09 |
2025-02-21 |
| graph perceptron |
🌲 |
2025-06-09 |
2025-02-05 |
| graph sequence converges if and only if the induced graphon sequence converges |
🌲 |
2025-06-09 |
2025-03-26 |
| graph shift operator |
🌲 |
2025-06-09 |
2025-01-22 |
| graph signal processing problem |
🌲 |
2025-06-09 |
2025-02-04 |
| graph signals |
🌲 |
2025-06-09 |
2025-01-22 |
| graph-level problem |
🌲 |
2025-06-09 |
2025-02-04 |
| graph |
🌲 |
2025-06-09 |
2025-01-22 |
| graphon convolution |
🌲 |
2025-06-09 |
2025-04-09 |
| graphon shift operator eigenvalues |
🌲 |
2025-06-09 |
2025-04-01 |
| heaviside functions |
🪴 |
2025-06-09 |
2025-02-04 |
| homomorphism density |
🌲 |
2025-06-09 |
2025-03-04 |
| hypothesis class |
🪴 |
2025-06-09 |
2025-02-04 |
| induced graphon signal |
🌲 |
2025-06-09 |
2025-03-26 |
| induced graphon |
🪴 |
2025-06-09 |
2025-03-24 |
| inductive learning |
🫘 |
2025-06-09 |
2025-02-04 |
| infinity norm for continuous bounded function space |
🌲 |
2025-06-09 |
2025-05-27 |
| information theoretic threshold |
🌲 |
2025-06-09 |
2025-02-12 |
| integral Lipschitz filter |
🌲 |
2025-06-09 |
2025-03-10 |
| integral lipschitz filters are stable to dilations |
🌲 |
2025-06-09 |
2025-03-10 |
| invariant |
🌲 |
2025-06-09 |
2025-01-30 |
| inverse graph fourier transform |
🌲 |
2025-06-09 |
2025-01-29 |
| kernel cut metric |
🪴 |
2025-06-09 |
2025-03-24 |
| kernel cut norm |
🌲 |
2025-06-09 |
2025-03-24 |
| l-p vector space |
🌲 |
2025-06-09 |
2025-05-27 |
| leaky ReLU |
🌲 |
2025-06-09 |
2025-02-19 |
| linear graph filter |
🌲 |
2025-06-09 |
2025-01-29 |
| maximal element |
🌲 |
2025-06-09 |
2025-06-05 |
| message passing neural network |
🌲 |
2025-06-09 |
2025-02-18 |
| multi-layer graph perceptron |
🌲 |
2025-06-09 |
2025-02-05 |
| node-level task |
🌲 |
2025-06-09 |
2025-02-04 |
| open mapping theorem |
🌲 |
2025-06-09 |
2025-06-05 |
| operator distance modulo permutations |
🌲 |
2025-06-09 |
2025-03-05 |
| partial order |
🌲 |
2025-06-09 |
2025-06-05 |
| quasi-symmetry |
🌲 |
2025-06-09 |
2025-03-05 |
| quotient of a vector space |
🌲 |
2025-06-09 |
2025-06-05 |
| random graphs in a gin are good for graph isomorphism |
🌲 |
2025-06-09 |
2025-03-04 |
| readout layer |
🌲 |
2025-06-09 |
2025-02-19 |
| relative perturbation edge changes are tied to node degree |
🌲 |
2025-06-09 |
2025-03-10 |
| relative perturbations |
🌲 |
2025-06-09 |
2025-03-10 |
| semi-norm |
🌲 |
2025-06-09 |
2025-05-27 |
| signal to noise ratio |
🫘 |
2025-06-09 |
2025-02-10 |
| singular value decomposition |
🌲 |
2025-06-09 |
2024-10-11 |
| sometimes spectral algorithms fail |
🌲 |
2025-06-09 |
2025-02-12 |
| spectral clustering |
🫘 |
2025-06-09 |
2025-02-10 |
| spectral embedding |
🌲 |
2025-06-09 |
2025-02-12 |
| spectral graph filter |
🌲 |
2025-06-09 |
2025-02-04 |
| spectral representation of a convolutional graph filter |
🌲 |
2025-06-09 |
2025-01-29 |
| stability and size tradeoff for realistic sparsity pattern considerations setting |
🪴 |
2025-06-09 |
2025-03-10 |
| stability-discriminability tradeoff for Lipschitz filters |
🌲 |
2025-06-09 |
2025-03-10 |
| stable graph filter |
🌲 |
2025-06-09 |
2025-03-10 |
| statistical risk minimization problem |
🌲 |
2025-06-09 |
2025-02-04 |
| stochastic block model |
🌲 |
2025-06-09 |
2025-02-10 |
| summable series |
🌲 |
2025-06-09 |
2025-05-29 |
| template graphs converge to the graphon |
🌲 |
2025-06-09 |
2025-03-26 |
| the cartesian product of banach spaces is banach |
🌲 |
2025-06-09 |
2025-06-05 |
| the spectral graph filter operates on a signal pointwise |
🌲 |
2025-06-09 |
2025-01-29 |
| the spectral representation of a graph filter is independent from the graph |
🌲 |
2025-06-09 |
2025-01-29 |
| upper bound |
🌲 |
2025-06-09 |
2025-06-05 |
| ways to sample graphs from graphons |
|
2025-06-09 |
2025-03-26 |
| we can represent any analytic function with convolutional graph filters |
🌲 |
2025-06-09 |
2025-02-04 |
| we can use GNNs to solve feature-aware semi-supervised learning problems |
🌲 |
2025-06-09 |
2025-02-12 |
| weighted graph (sample) |
🌲 |
2025-06-09 |
2025-03-26 |
| weighted sampled graphs converge to the graphon in probability |
🌲 |
2025-06-09 |
2025-03-26 |
