The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Structure of Growing Networks with Preferential Linking
Open accessAbstract
The model of growing networks with the preferential attachment of new links is generalized to include initial attractiveness of sites. We find the exact form of the stationary distribution of the number of incoming links of sites in the limit of long times, $P(q)$, and the long-time limit of the average connectivity $\overline{q}(s,t)$ of a site $s$ at time $t$ (one site is added per unit of time). At long times, $P(q)\ensuremath{\sim}{q}^{\ensuremath{-}\ensuremath{\gamma}}$ at $q\ensuremath{\rightarrow}\ensuremath{\infty}$ and $\overline{q}(s,t)\ensuremath{\sim}(s/t{)}^{\ensuremath{-}\ensuremath{\beta}}$ at $s/t\ensuremath{\rightarrow}0$, where the exponent $\ensuremath{\gamma}$ varies from $2$ to $\ensuremath{\infty}$ depending on the initial attractiveness of sites. We show that the relation $\ensuremath{\beta}(\ensuremath{\gamma}\ensuremath{-}1)\phantom{\rule{0ex}{0ex}}=\phantom{\rule{0ex}{0ex}}1$ between the exponents is universal.
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.
Integrity signals
Registry
Cites
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.
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
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
Cited by
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Newman (2005) · doi:10.1080/00107510500052444 · Cited by 5,749
Metadata
- Authors
- Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2000-11-20
- Volume
- 85
- Issue
- 21
- Pages
- 4633-4636
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1953975752
- Cited by
- 1,307
- References
- 2
- FWCI
- 22.30
- 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: Structure of Growing Networks with Preferential Linking. https://app.cochat.ai/papers/10.1103/physrevlett.85.4633
- The paper
- Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2000). Structure of Growing Networks with Preferential Linking. Physical Review Letters. https://doi.org/10.1103/physrevlett.85.4633
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.