Pith. sign in

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

arxiv 0804.1744 v1 pith:2ARNUUY7 submitted 2008-04-10 cond-mat.dis-nn cond-mat.stat-mech

classification cond-mat.dis-nncond-mat.stat-mech
keywords networkscomplexmatrixpropertiesrandomspectraspectraltheory
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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

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. Top eigenpair statistics of diluted Wishart matrices

    cond-mat.stat-mech 2025-01 conditional novelty 6.0 of 10

    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...

Pith tools