Metraipolis › archive › dc_6d1b68e599bc
Strong Convergence for Zig-Zag Products and Typical Spectra of Irregular Graphs — arXiv:2611.09732
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.09732
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:43:14.276Z
- SHA-256 of the archived text
d2dca0fdcb621c686f42bad25e72e2dd453162c04cee94517e324a40216c3f58- Stable URL of this page
https://metraipolis.com/documento/dc_6d1b68e599bc
How to cite
Strong Convergence for Zig-Zag Products and Typical Spectra of Irregular Graphs — arXiv:2611.09732 — arXiv (en), https://arxiv.org/abs/2611.09732 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6d1b68e599bc (Metraipolis archive dc_6d1b68e599bc, sha256 d2dca0fdcb621c686f42bad25e72e2dd453162c04cee94517e324a40216c3f58)
BibTeX
@misc{dc6d1b68e599bc,
title = {Strong Convergence for Zig-Zag Products and Typical Spectra of Irregular Graphs — arXiv:2611.09732},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.09732},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6d1b68e599bc; sha256 d2dca0fdcb621c686f42bad25e72e2dd453162c04cee94517e324a40216c3f58},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.09732. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We investigate the following: do existence bounds obtained by interlacing methods describe the spectra of typical random graphs? Depending on the model, we provide both positive and negative answers. We establish a Friedman-type theorem for zig-zag products of random regular graphs $G$ with a fixed vertex-transitive gadget $H$, where $G$ is sampled from independent permutations or matchings. We prove that the new spectrum converges in Hausdorff distance to that of the zig-zag product of the infinite regular tree with $H$. In particular, the new spectral radius converges to the sharp threshold established by Cohen, Cohen, and Maor. We establish the spectral limit using strong convergence and, drawing on quantitative estimates of Chen, Garza-Vargas, Tropp, and van Handel, obtain an $O(1/n)$ upper-tail bound in the permutation model. For the irregular configuration model, we show that the interlacing bound of Cohen and Maor, asymptotically $2\sqrt{\mu-1}/\mu$ for limiting average degree $\mu$, is atypical: for uniformly bounded degree sequences with a nonconstant limiting degree law of minimum $\delta\ge 2$, a random graph exceeds the interlacing bound by a positive constant with high probability. This gap is explained by the limiting spectral distribution, whose support edge is $2\sqrt{\delta-1}/\delta$. Strikingly, unlike the familiar behavior of random regular graphs, our experiments reveal second eigenvalues that remain far below this limiting edge even for the largest graphs tested. For $\delta\ge3$, we propose that the scarcity of minimum-degree trees explains this behavior; estimates for their size suggest spectral witnesses within $O\left((\log\log n)^{-2}\right)$ of the limiting edge, which is consistent with our numerical observations.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR) ; Group Theory (math.GR); Operator Algebras (math.OA).
Pagina del lavoro: https://arxiv.org/abs/2611.09732 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-09T22:36:02.252Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).