Tree walks and the spectrum of random graphs

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Hainzl, Eva-Maria, de Panafieu, Élie
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866929343304826880
author Hainzl, Eva-Maria
de Panafieu, Élie
author_facet Hainzl, Eva-Maria
de Panafieu, Élie
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2405_08347
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Tree walks and the spectrum of random graphs
Hainzl, Eva-Maria
de Panafieu, Élie
Combinatorics
Spectral Theory
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.
title Tree walks and the spectrum of random graphs
topic Combinatorics
Spectral Theory
url https://arxiv.org/abs/2405.08347