We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

math.CO

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Mathematics > Combinatorics

Title: Tree walks and the spectrum of random graphs

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.
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)
Subjects: Combinatorics (math.CO); Spectral Theory (math.SP)
Cite as: arXiv:2405.08347 [math.CO]
  (or arXiv:2405.08347v1 [math.CO] for this version)

Submission history

From: Elie de Panafieu [view email]
[v1] Tue, 14 May 2024 06:38:08 GMT (2233kb,D)

Link back to: arXiv, form interface, contact.