A Spectral Analysis of Graph Neural Networks on Dense and Sparse Graphs
Not on the map. Why?
Abstract (arXiv)
In this work we propose a random graph model that can produce graphs at different levels of sparsity. We analyze how sparsity affects the graph spectra, and thus the performance of graph neural networks (GNNs) in node classification on dense and sparse graphs. We compare GNNs with spectral methods known to provide consistent estimators for community detection on dense graphs, a closely related task. We show that GNNs can outperform spectral methods on sparse graphs, and illustrate these results with numerical examples on both synthetic and real graphs.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 26 of its 38 references that are in the map. First posted on arXiv 6 Nov 2022.
Builds on
26 of 38 references.
References · 26
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
- 2019Multi-scale Attributed Node Embeddingcited by 543
- 2017Graph Signal Processing: Overview, Challenges and Applicationscited by 409
- 2017Community Detection and Stochastic Block Modelscited by 317
- 2020Combining Label Propagation and Simple Models Out-performs Graph Neural Networkscited by 199
- 2019Universal Invariant and Equivariant Graph Neural Networkscited by 182
- 2021Is Homophily a Necessity for Graph Neural Networks?cited by 182
- 2022How Powerful are Spectral Graph Neural Networkscited by 169
- 2019Stability Properties of Graph Neural Networkscited by 125
- 2020Graphon Neural Networks and the Transferability of Graph Neural Networkscited by 117
14 more
- 2020Graph Neural Networks: Architectures, Stability and Transferabilitycited by 79
- 2017Statistical inference on random dot product graphs: a surveycited by 70
- 2021Graph Convolution for Semi-Supervised Classification: Improved Linear Separability and Out-of-Distribution Generalizationcited by 70
- 2013Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodelcited by 45
- 2014Community Detection in Networks with Node Attributescited by 44
- 2021Transferability Properties of Graph Neural Networkscited by 42
- 2019Inference for multiple heterogeneous networks with a common invariant subspacecited by 39
- 2020Graphon Signal Processingcited by 37
- 2014Covariate-assisted spectral clusteringcited by 29
- 2022Effects of Graph Convolutions in Multi-layer Networkscited by 24
- 2019Spectral inference for large Stochastic Blockmodels with nodal covariatescited by 6
- 2022When Does A Spectral Graph Neural Network Fail in Node Classification?cited by 6
- 2020On spectral algorithms for community detection in stochastic blockmodel graphs with vertex covariatescited by 4
- 2017Weighted Message Passing and Minimum Energy Flow for Heterogeneous Stochastic Block Models with Side Informationcited by 3
Built on by
Citing papers per year: 2023: 2; 2024: 3.
5 papers.
- 2023A Neural Collapse Perspective on Feature Evolution in Graph Neural Networkscited by 19
- 2023Limits, approximation and size transferability for GNNs on sparse graphs via graphopscited by 17
- 2024Graph neural networks and non-commuting operatorscited by 5
- 2024Sampling Transferable Graph Neural Networks with Limited Graph Informationcited by 0
- 2024LASE: Learned Adjacency Spectral Embeddingscited by 0
- 2024LASE: Learned Adjacency Spectral Embeddings23 Dec 2024
- 2024Graph neural networks and non-commuting operators6 Nov 2024
- 2024Sampling Transferable Graph Neural Networks with Limited Graph Information22 Oct 2024
- 2023A Neural Collapse Perspective on Feature Evolution in Graph Neural Networks4 Jul 2023
- 2023Limits, approximation and size transferability for GNNs on sparse graphs via graphops7 Jun 2023