Statistical Guarantees for Link Prediction using Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
This paper derives statistical guarantees for the performance of Graph Neural Networks (GNNs) in link prediction tasks on graphs generated by a graphon. We propose a linear GNN architecture (LG-GNN) that produces consistent estimators for the underlying edge probabilities. We establish a bound on the mean squared error and give guarantees on the ability of LG-GNN to detect high-probability edges. Our guarantees hold for both sparse and dense graphs. Finally, we demonstrate some of the shortcomings of the classical GCN architecture, as well as verify our results on real and synthetic datasets.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 15 of its 49 references that are in the map. First posted on arXiv 5 Feb 2024.
Builds on
15 of 49 references.
References · 15
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2018Link Prediction Based on Graph Neural Networkscited by 829
- 2020The Surprising Power of Graph Neural Networks with Random Node Initializationcited by 190
- 2020Building powerful and equivariant graph neural networks with structural message-passingcited by 95
- 2020Convergence and Stability of Graph Convolutional Networks on Large Random Graphscited by 75
- 2021Graph Convolution for Semi-Supervised Classification: Improved Linear Separability and Out-of-Distribution Generalizationcited by 70
- 2022Generalization Analysis of Message Passing Neural Networks on Large Random Graphscited by 58
- 2021Learning Theory Can (Sometimes) Explain Generalisation in Graph Neural Networkscited by 51
- 2021On the Universality of Graph Neural Networks on Large Random Graphscited by 26
- 2020Strong Consistency, Graph Laplacians, and the Stochastic Block Modelcited by 20
- 2021Asymptotics of Network Embeddings Learned via Subsamplingcited by 10
3 more
Built on by
Citing papers per year: 2024: 2.
2 papers.