REVIEW 1 cited by
Spectral properties of complex networks
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
Signed reviews
read the original abstract
We derive the spectral properties of adjacency matrix of complex networks and of their Laplacian by the replica method combined with a dynamical population algorithm. By assuming the order parameter to be a product of Gaussian distributions, the present theory provides a solution for the non linear integral equations for the spectra density in random matrix theory of the spectra of sparse random matrices making a step forward with respect to the effective medium approximation (EMA) . We extend these results also to weighted networks with weight-degree correlations
Forward citations
Cited by 1 Pith paper
-
Top eigenpair statistics of diluted Wishart matrices
For sparse sample covariance matrices X^T X with nonzero-mean weights, the typical largest eigenvalue and top eigenvector component distribution are obtained from replica-based recursive distributional equations solve...
Discussion (0). Continue with ORCID to comment.