pith. sign in

arxiv: 1310.8216 · v2 · pith:FCTBFGZJnew · submitted 2013-10-30 · 🧮 math.PR

Spectra of large diluted but bushy random graphs

classification 🧮 math.PR
keywords expansiongraphsrandomadjacencyasymptoticbushycomputedifferent
0
0 comments X
read the original 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 Erd\H{o}s-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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.