A. Baranwal, K. Fountoulakis, and A. Jagannath. Graph Convolution for Semi-Supervised Classification: Improved Linear Separability and Out-of-Distribution Generalization. In Proceedings of the 38th International Conference on Machine Learning, volume 139 of Proc. of Mach. Learn. Res., pages 684-693. PMLR, 18-24 Jul 2021.
A. Baranwal, K. Fountoulakis, and A. Jagannath. Effects of Graph Convolutions in Multi-layer Networks. In The Eleventh International Conference on Learning Representations, 2023.
A. D. Barbour and L. H. Y. Chen. An introduction to Stein's method, volume 4. World Scientific, 2005.
P. Battaglia, R. Pascanu, M. Lai, D. J. Rezende, and K. Kavukcuoglu. Interaction Networks for Learning about Objects, Relations and Physics. In Advances in Neural Information Processing Systems (NeurIPS), 2016.
C. Bordenave. Lecture notes on random graphs and probabilistic combinatorial optimization, 2016.
L. H. Y. Chen. Poisson Approximation for Dependent Trials. The Annals of Probability, 3(3):534-545, 1975.
M. Chen, Z. Wei, Z. Huang, B. Ding, and Y. Li. Simple and Deep Graph Convolutional Networks. In H. D. III and A. Singh, editors, Proceedings of the 37th International Conference on Machine Learning, volume 119 of Proceedings of Machine Learning Research, pages 1725-1735. PMLR, 13-18 Jul 2020.
Z. Chen, S. Villar, L. Chen, and J. Bruna. On the equivalence between graph isomorphism testing and function approximation with GNNs. In H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alché-Buc, E. Fox, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 32. Curran Associates, Inc., 2019.
E. Chien, W.-C. Chang, C.-J. Hsieh, H.-F. Yu, J. Zhang, O. Milenkovic, and I. S. Dhillon. Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction. In International Conference on Learning Representations, 2022.
F. Chung and L. Lu. The diameter of sparse random graphs. Advances in Applied Mathematics, 26 (4):257-279, 2001.
Y. Deshpande, S. Sen, A. Montanari, and E. Mossel. Contextual Stochastic Block Models. In Advances in Neural Information Processing Systems (NeurIPS), 2018.
J. Dreier, P. Kuinke, B. Le Xuan, et al. Local Structure Theorems for Erdos-Rényi Graphs and Their Algorithmic Applications. SOFSEM 2018: Theory and Practice of Computer Science LNCS 10706, page 125, 2018.
J. Feng, Y. Chen, F. Li, A. Sarkar, and M. Zhang. How powerful are k-hop message passing graph neural networks. In A. H. Oh, A. Agarwal, D. Belgrave, and K. Cho, editors, Advances in Neural Information Processing Systems, 2022.
M. Fey and J. E. Lenssen. Fast Graph Representation Learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds, 2019.
K. Fountoulakis, D. He, S. Lattanzi, B. Perozzi, A. Tsitsulin, and S. Yang. On classification thresholds for graph attention with edge features. arXiv preprint arXiv:2210.10014, 2022a.
K. Fountoulakis, A. Levi, S. Yang, A. Baranwal, and A. Jagannath. Graph Attention Retrospective. arXiv preprint arXiv:2202.13060, 2022b.
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl. Neural Message Passing for Quantum Chemistry. In Proceedings of the 34th International Conference on Machine Learning, 2017.
L. Gosch, D. Sturm, S. Geisler, and S. Gunnemann. Revisiting robustness in graph machine learning. In The Eleventh International Conference on Learning Representations, 2023. URL https://openreview.net/forum?id=h1o7Ry9Zctm.