[65] N. Keriven, A. Bietti, and S. Vaiter. On the universality of graph neural networks on large random graphs. In Advances in Neural Information Processing Systems, 2021. 4
[66] S. Kiefer. Power and Limits of the Weisfeiler-Leman Algorithm. PhD thesis, Department of Computer Science, RWTH Aachen University, 2020. 17
[67] S. Kiefer and B. D. McKay. The iteration number of Colour Refinement. In International Colloquium on Automata, Languages, and Programming, pages 73:1-73:19, 2020. 17
[68] S. Kiefer and D. Neuen. The power of the Weisfeiler-Leman algorithm to decompose graphs. SIAM Journal on Discrete Mathematics, 36(1):252-298, 2022. 17
[69] S. Kiefer and P. Schweitzer. Upper bounds on the quantifier depth for graph differentiation in first order logic. In Symposium on Logic in Computer Science, pages 287-296, 2016. 17
[70] S. Kiefer, P. Schweitzer, and E. Selman. Graphs identified by logics with counting. In International Symposium on Mathematical Foundations of Computer Science, pages 319–330, 2015. 17
[71] S. Kiefer, I. Ponomarenko, and P. Schweitzer. The Weisfeiler-Leman dimension of planar graphs is at most 3. Journal of the ACM, 66(6):44:1-44:31, 2019. 17
[72] D. P. Kingma and J. Ba. Adam: A method for stochastic optimization. In International Conference on Learning Representations, 2015. 18
[73] T. N. Kipf and M. Welling. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations, 2017. 2
[74] D. B. Kireev. Chemnet: A novel neural network based method for graph/property mapping. Journal of Chemical Information and Computer Sciences, 35(2):175-180, 1995. 2
[75] R. Levie, F. Monti, X. Bresson, and M. M. Bronstein. Cayleynets: Graph convolutional neural networks with complex rational spectral filters. IEEE Transactions on Signal Processing, 67(1): 97-109, 2019. 2
[76] M. Lichter, I. Ponomarenko, and P. Schweitzer. Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. In Symposium on Logic in Computer Science, pages 1-13, 2019. 17
[77] L. Lovász and B. Szegedy. Limits of dense graph sequences. Journal of Combinatorial Theory, Series B, 96(6):933-957, Nov. 2006. 4, 20
[78] L. Lovász. Large Networks and Graph Limits., volume 60 of Colloquium Publications. American Mathematical Society, 2012. 1, 4, 5, 19
[79] T. Maehara and H. NT. A simple proof of the universality of invariant/equivariant graph neural networks. ArXiv preprint, 2019. 3, 20
[80] P. N. Malkin. Sherali-adams relaxations of graph isomorphism polytopes. Discrete Optimization, pages 73-97, 2014. 17
[81] H. Maron, H. Ben-Hamu, H. Serviansky, and Y. Lipman. Provably powerful graph networks. In Advances in Neural Information Processing Systems, pages 2153–2164, 2019. 3, 20
[82] S. Maskey, R. Levie, Y. Lee, and G. Kutyniok. Generalization analysis of message passing neural networks on large random graphs. In A. H. Oh, A. Agarwal, D. Belgrave, and K. Cho, editors, Advances in Neural Information Processing Systems, 2022. 1, 4
[83] S. Maskey, R. Levie, and G. Kutyniok. Transferability of graph neural networks: An extended graphon approach. Applied and Computational Harmonic Analysis, 63:48-83, 2023. 4
[84] C. Merkwirth and T. Lengauer. Automatic generation of complementary descriptors with molecular graph networks. Journal of Chemical Information and Modeling, 45(5):1159-1168, 2005. 2
[85] A. Micheli. Neural network for graphs: A contextual constructive approach. IEEE Transactions on Neural Networks, 20(3):498-511, 2009. 2
[86] A. Micheli and A. S. Sestito. A new neural network model for contextual processing of graphs. In Italian Workshop on Neural Nets Neural Nets and International Workshop on Natural and Artificial Immune Systems, pages 10-17, 2005. 2
[87] F. Monti, D. Boscaini, J. Masci, E. Rodolà, J. Svoboda, and M. M. Bronstein. Geometric deep learning on graphs and manifolds using mixture model cnns. In IEEE Conference on Computer Vision and Pattern Recognition, pages 5425-5434, 2017. 2