arXiv · 2611.23238
Spectral dimension reduction of dynamical systems on graphons
Abstract
Spectral dimension reduction approximates a dynamical system on a large network by a low-dimensional system whose variables are weighted averages of the node states, with weights given by dominant eigenvectors of the network. Its effectiveness is closely related to the low-rank structure of the interaction matrix. We develop a graphon analogue of this reduction for dynamical systems on dense graph limits. For graphon dynamical systems, we formulate the reduction in terms of the compact self-adjoint integral operator associated with the graphon. This operator-theoretic setting gives a continuum analogue of the spectral/SVD-based framework used for finite networks: the eigenfunctions provide the reduction basis, and the decay of the corresponding singular values quantifies the effect of discarded modes. For finite-rank graphons, we prove exact reduction results for two classes of graphon dynamical systems. We also show that, for finite-rank graphons, the reduced system preserves equilibria, linear stability, and local bifurcations. For infinite-rank graphons, we derive error bounds for the spectral reduction. Numerical examples using finite-rank and infinite-rank graphons illustrate the exact and approximate regimes of the theory.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Naoki Masuda, Bisna Mary Eldo. 2026-08-30. Spectral dimension reduction of dynamical systems on graphons. https://searcharxiv.com/abs/2611.23238
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.