Spectra of large diluted but bushy random graphs
Abstract
We compute an asymptotic expansion in 1/c of the limit in n of the empirical spectral measure of the adjacency matrix of an Erdos-R\'enyi random graph with n vertices and parameter c/n. We present two different methods, one of which is valid for the more general setting of locally tree-like graphs. The second order in the expansion gives some information about the edge.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.