Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 280

The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.

Spectra of complex networks

Open access
Dorogovtsev, S. N., Goltsev, A. V., Mendes, J. F. F., Samukhin, A. N.·2003·Physical Review E

Abstract

We propose a general approach to the description of spectra of complex networks. For the spectra of networks with uncorrelated vertices (and a local treelike structure), exact equations are derived. These equations are generalized to the case of networks with correlations between neighboring vertices. The tail of the density of eigenvalues rho(lambda) at large /lambda/ is related to the behavior of the vertex degree distribution P(k) at large k. In particular, as P(k) approximately k(-gamma), rho(lambda) approximately /lambda/(1-2 gamma). We propose a simple approximation, which enables us to calculate spectra of various graphs analytically. We analyze spectra of various complex networks and discuss the role of vertices of low degree. We show that spectra of locally treelike random graphs may serve as a starting point in the analysis of spectral properties of real-world networks, e.g., of the Internet.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreve.68.046109

Cites

42 of 42 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 42 references

Cited by

See all 280

Metadata

Authors
Dorogovtsev, S. N., Goltsev, A. V., Mendes, J. F. F., & Samukhin, A. N.
Venue
Physical Review E
Published
2003-10-10
Volume
68
Issue
4
Pages
046109-046109
ISSN
  • 1063-651X (ISSN-L)
  • 1095-3787
OpenAlex
W2091322850
Cited by
280
References
42
FWCI
5.52
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Spectra of complex networks. https://app.cochat.ai/papers/10.1103/physreve.68.046109
The paper
Dorogovtsev, S. N., Goltsev, A. V., Mendes, J. F. F., & Samukhin, A. N. (2003). Spectra of complex networks. Physical Review E. https://doi.org/10.1103/physreve.68.046109

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.