[41] A. Frieze and R. Kannan. Quick Approximation to Matrices and Applications. Combinatorica, 19 (2):175-220, Feb. 1999. 4, 20
[42] M. Fürer. On the combinatorial power of the Weisfeiler-Lehman algorithm. In International Conference on Algorithms and Complexity, pages 260–271, 2017. 17
[43] F. Gama, A. G. Marques, G. Leus, and A. Ribeiro. Convolutional neural network architectures for signals supported on graphs. IEEE Transactions on Signal Processing, 67(4):1034-1049, 2019. 2
[44] F. Gama, J. Bruna, and A. Ribeiro. Stability properties of graph neural networks. IEEE Transactions on Signal Processiong, 68:5680-5695, 2020. 1
[45] U. García-Palomares and M. Evarist Giné. On the linear programming approach to the optimality property of Prokhorov's distance. Journal of Mathematical Analysis and Applications, 60(3): 596-600, Oct. 1977. 24, 28, 29
[46] B. Garel and J.-C. Massé. Calculation of the Prokhorov distance by optimal quantization and maximum flow. AStA Advances in Statistical Analysis, 93(1):73-88, Mar. 2009. 24
[47] F. Geerts. The expressive power of kth-order invariant graph networks. ArXiv preprint, 2020. 3, 20
[48] F. Geerts and J. L. Reutter. Expressiveness and approximation properties of graph neural networks. In International Conference on Learning Representations, 2022. 3, 20
[49] F. Geerts, F. Mazowiecki, and G. A. Pérez. Let's agree to degree: Comparing graph convolutional networks in the message-passing framework. In International Conference on Machine Learning, pages 3640–3649, 2021. 20
[50] J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl. Neural message passing for quantum chemistry. In International Conference on Machine Learning, pages 1263–1272, 2017. 1, 2, 18
[51] C. Goller and A. Kuchler. Learning task-dependent distributed representations by backpropagation through structure. In International Conference on Neural Networks, pages 347-352, 1996. 2
[52] J. Grebík and I. Rocha. Fractional Isomorphism of Graphons. ArXiv preprint, Feb. 2021. 1, 4, 5, 6, 8, 19, 34, 36
[53] M. Grohe. Descriptive Complexity, Canonisation, and Definable Graph Structure Theory. Cambridge University Press, 2017. 17
[54] M. Grohe. Word2vec, Node2vec, Graph2vec, X2vec: Towards a theory of vector embeddings of structured data. In Symposium on Principles of Database Systems, pages 1-16, 2020. 18
[55] M. Grohe. The logic of graph neural networks. In Symposium on Logic in Computer Science, pages 1-17, 2021. 17
[56] M. Grohe. The descriptive complexity of graph neural networks. ArXiv preprint, abs/2303.04613, 2023. 20
[57] M. Grohe and M. Otto. Pebble games and linear equations. Journal of Symbolic Logic, 80(3): 797-844, 2015. 17
[58] M. Grohe, P. Schweitzer, and D. Wiebking. Deep Weisfeiler Leman. ArXiv preprint, 2020. 17
[59] M. Grohe, M. Lichter, and D. Neuen. The iteration number of the Weisfeiler-Leman algorithm. CoRR, abs/2301.13317, 2023. 17
[60] S. Gunnemann. Graph neural networks: Adversarial robustness. In L. Wu, P. Cui, J. Pei, and L. Zhao, editors, Graph Neural Networks: Foundations, Frontiers, and Applications, pages 149-176. Springer, 2022. 1
[61] W. L. Hamilton, Z. Ying, and J. Leskovec. Inductive representation learning on large graphs. In Advances in Neural Information Processing Systems, pages 1024–1034, 2017. 2
[62] N. Immerman and E. Lander. Describing graphs: A first-order approach to graph canonization. In Complexity Theory Retrospective: In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, July 5, 1988, pages 59-81, 1990. 17
[63] A. S. Kechris. Classical Descriptive Set Theory. Springer, 1995. 4, 5
[64] N. Keriven, A. Bietti, and S. Vaiter. Convergence and stability of graph convolutional networks on large random graphs. In Advances in Neural Information Processing Systems, pages 21512-21523, 2020. 4