Pith. sign in

REVIEW 1 cited by

The eigenvalues of stochastic blockmodel 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

arxiv 1803.11551 v1 pith:YI4VB5V4 submitted 2018-03-30 stat.ML cs.LG

classification stat.MLcs.LG
keywords eigenvaluesblockmodelgraphslargestresultstochasticadjacencybounded
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We derive the limiting distribution for the largest eigenvalues of the adjacency matrix for a stochastic blockmodel graph when the number of vertices tends to infinity. We show that, in the limit, these eigenvalues are jointly multivariate normal with bounded covariances. Our result extends the classic result of F\"{u}redi and Koml\'{o}s on the fluctuation of the largest eigenvalue for Erd\H{o}s-R\'{e}nyi graphs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The Spectral Barycentre of a Set of Graphs with Community Structure

    cs.SI 2025-01 conditional novelty 6.0 of 10

    The barycentre graph of a graph dataset is reconstructed by pairing the mean Laplacian spectrum with Soules-basis eigenvectors aligned to communities, and for balanced stochastic block models this reconstruction is cl...

Pith tools