REVIEW
Spectra of large diluted but bushy random graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Spectra of large diluted but bushy random graphs
classification
math.PR
keywords
expansiongraphsrandomadjacencyasymptoticbushycomputedifferent
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.