REVIEW 1 cited by
Spectral density of random graphs with topological constraints
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
Spectral density of random graphs with topological constraints
read the original abstract
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case an exact solution is found for the spectral density in the form of consistency equations depending on the statistical properties of the graph ensemble in question. We highlight the effect of these topological constraints on the resulting spectral density.
Forward citations
Cited by 1 Pith paper
-
Spectral Signatures of Replica Symmetry Breaking in Optimization-Induced Random Matrices
Difference spectra of two optimization-induced matrices from independent Gibbs samples form an explicit spectral transform of the Parisi overlap order parameter, while a single-matrix bulk is blind to replica symmetry...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.