arXiv Analytics

Sign in

arXiv:2405.08347 [math.CO]AbstractReferencesReviewsResources

Tree walks and the spectrum of random graphs

Eva-Maria Hainzl, Élie de Panafieu

Published 2024-05-14Version 1

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.

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)
Categories: math.CO, math.SP
Related articles: Most relevant | Search more
arXiv:1311.6423 [math.CO] (Published 2013-11-25, updated 2014-01-28)
Rainbow Matchings and Hamilton Cycles in Random Graphs
arXiv:math/0306266 [math.CO] (Published 2003-06-18)
The Lovasz number of random graphs
arXiv:0805.2709 [math.CO] (Published 2008-05-18)
Cops and robbers in random graphs