A Spectral Framework for Graph Neural Operators: Convergence Guarantees and Tradeoffs
Abstract
Graphons, as limits of graph sequences, provide an operator-theoretic framework for analyzing the asymptotic behavior of graph neural operators. Spectral convergence of sampled graphs to graphons induces convergence of the corresponding neural operators, enabling transferability analyses of graph neural networks (GNNs). This paper develops a unified spectral framework that brings together convergence results under different assumptions on the underlying graphon, including no regularity, global Lipschitz continuity, and piecewise-Lipschitz continuity. The framework places these results in a common operator setting, enabling direct comparison of their assumptions, convergence rates, and tradeoffs. We further illustrate the empirical tightness of these rates on synthetic and real-world graphs.
Cite
@article{arxiv.2510.20954,
title = {A Spectral Framework for Graph Neural Operators: Convergence Guarantees and Tradeoffs},
author = {Roxanne Holden and Luana Ruiz},
journal= {arXiv preprint arXiv:2510.20954},
year = {2026}
}