The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Scaling behaviour of developing and decaying networks
Open accessAbstract
We find that a wide class of developing and decaying networks has scaling properties similar to those that were recently observed by Barabási and Albert in the particular case of growing networks. The networks considered here evolve according to the following rules: i) Each instant a new site is added, the probability of its connection to old sites is proportional to their connectivities. ii) In addition, a) new links between some old sites appear with probability proportional to the product of their connectivities or b) some links between old sites are removed with equal probability.
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
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
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
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Self-citationNewman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
Metadata
- Authors
- Dorogovtsev, S. N., & Mendes, J. F. F.
- Venue
- Europhysics Letters (EPL)
- Publisher
- IOP Publishing
- Published
- 2000-10-01
- Volume
- 52
- Issue
- 1
- Pages
- 33-39
- ISSN
- 0295-5075 (ISSN-L)
- 1286-4854
- OpenAlex
- W1972083320
- Cited by
- 250
- References
- 1
- FWCI
- 7.36
- 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: Scaling behaviour of developing and decaying networks. https://app.cochat.ai/papers/10.1209/epl/i2000-00400-0
- The paper
- Dorogovtsev, S. N., & Mendes, J. F. F. (2000). Scaling behaviour of developing and decaying networks. Europhysics Letters (EPL). https://doi.org/10.1209/epl/i2000-00400-0
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.