Spectral Convergence of Sparse Bipartite Graphs via the Line-Graphon
Abstract
Pure point spectral convergence is generally unavailable for sparse graph sequences, where Laplacian eigenvalues may remain unstable under graph growth. This poses challenges for analyzing spectral operators underlying many graph-based learning methods, including graph neural networks. We identify a class of sparse bipartite graph sequences for which eigenvalue-level spectral convergence can be recovered. Focusing on graphs with strong degree heterogeneity, we exploit the convergence properties of their line-graph sequences. Using a spectral correspondence between bipartite graph Laplacians and line-graph adjacency operators, we transfer convergence guarantees from dense line-graphs back to the original sparse graphs. This framework yields eigenvalue-level spectral convergence for a class of deterministic sparse graph sequences. We further analyze superlinear preferential attachment trees, establishing convergence to an infinite-dimensional limit operator. Numerical experiments empirically support our spectral convergence results.
Related
- Spectral radius and size conditions for 1-tough balanced bipartite graphs to contain a k-factor with k≥ 3
- Signless Laplacian spectral conditions for rainbow matchings in a collection of bipartite graphs
- Local Convergence of Triadic Closures of Sparse Random Graphs
- The spectral edge of sparse directed Erdös-Rényi graphs
- Nonlocal Hamiltonian Dynamics on Sparse Lévy Graphs: Spectral Analysis and Multimodal Sampling
BibTeX
@misc{holden2026spectral,
title = {{Spectral Convergence of Sparse Bipartite Graphs via the Line-Graphon}},
author = {Roxanne Holden and Luana Ruiz},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.08246},
eprint = {2611.08246},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.08246},
}
RIS
TY - UNPB
TI - Spectral Convergence of Sparse Bipartite Graphs via the Line-Graphon
AU - Roxanne Holden
AU - Luana Ruiz
PY - 2026
DA - 2026/11/05
PB - arXiv
DO - 10.48550/arxiv.2611.08246
UR - https://arxiv.org/abs/2611.08246
AB - Pure point spectral convergence is generally unavailable for sparse graph sequences, where Laplacian eigenvalues may remain unstable under graph growth. This poses challenges for analyzing spectral operators underlying many graph-based learning methods, including graph neural networks. We identify a class of sparse bipartite graph sequences for which eigenvalue-level spectral convergence can be recovered. Focusing on graphs with strong degree heterogeneity, we exploit the convergence properties of their line-graph sequences. Using a spectral correspondence between bipartite graph Laplacians and line-graph adjacency operators, we transfer convergence guarantees from dense line-graphs back to the original sparse graphs. This framework yields eigenvalue-level spectral convergence for a class of deterministic sparse graph sequences. We further analyze superlinear preferential attachment trees, establishing convergence to an infinite-dimensional limit operator. Numerical experiments empirically support our spectral convergence results.
ER -