Tree walks and the spectrum of random graphs
Combinatorics
2024-05-15 v1 Spectral Theory
Abstract
It is a classic result in spectral theory that the limit distribution of the spectral measure of random graphs G(n, p) converges to the semicircle law in case np tends to infinity with n. The spectral measure for random graphs G(n, c/n) however is less understood. In this work, we combine and extend two combinatorial approaches by Bauer and Golinelli (2001) and Enriquez and Menard (2016) and approximate the moments of the spectral measure by counting walks that span trees.
Keywords
Cite
@article{arxiv.2405.08347,
title = {Tree walks and the spectrum of random graphs},
author = {Eva-Maria Hainzl and Élie de Panafieu},
journal= {arXiv preprint arXiv:2405.08347},
year = {2024}
}
Comments
26 pages, long version of a paper presented at the 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)