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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Evolution of the social network of scientific collaborations
Barabási, A. L., Jeong, H., Néda, Z., Ravasz, E., Schubert, A., & Vicsek, T. (2002) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(02)00736-7 · Cited by 1,972
Dynamical and Correlation Properties of the Internet
Pastor-Satorras, R., Vázquez, A., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.258701 · Cited by 1,466
Large-scale topological and dynamical properties of the Internet
Vázquez, A., Pastor-Satorras, R., & Vespignani, A. (2002) · Physical Review E · doi:10.1103/physreve.65.066130 · Cited by 712
Coevolution of Strategy and Structure in Complex Networks with Dynamical Linking
Pacheco, J. M., Traulsen, A., & Nowak, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.258103 · Cited by 697
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2002) · Physical Review E · doi:10.1103/physreve.65.066122 · Cited by 540
Self-citationStructure of growing social networks
Jin, E. M., Girvan, M., & Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.046132 · Cited by 505
Modeling of Protein Interaction Networks
Vázquez, A., Flammini, A., Maritan, A., & Vespignani, A. (2003) · Complexus · doi:10.1159/000067642 · Cited by 472
Yook, S. H., Jeong, H., Barabási, A.-L., & Tu, Y. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5835 · Cited by 466
Modeling the world-wide airport network
Guimerá, R., & Amaral, L. A. N. (2004) · The European Physical Journal B · doi:10.1140/epjb/e2004-00131-0 · Cited by 466
Deterministic scale-free networks
Barabási, A.-L., Ravasz, E., & Vicsek, T. (2001) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(01)00369-7 · Cited by 464
Are randomly grown graphs really random?
Callaway, D. S., Hopcroft, J. E., Kleinberg, J. M., Newman, M. E. J., & Strogatz, S. H. (2001) · Physical Review E · doi:10.1103/physreve.64.041902 · Cited by 448
A local-world evolving network model
Li, X., & Chen, G. (2003) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(03)00604-6 · Cited by 399
Degree Distributions of Growing Networks
Krapivsky, P. L., Rodgers, G. J., & Redner, S. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5401 · Cited by 312
Size-dependent degree distribution of a scale-free growing network
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2001) · Physical Review E · doi:10.1103/physreve.63.062101 · Cited by 311
Self-citationLanguage as an evolving word web
Dorogovtsev, S. N., & Mendes, J. F. F. (2001) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rspb.2001.1824 · Cited by 280
Self-citationHow the global structure of protein interaction networks evolves
Wagner, A. (2003) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rspb.2002.2269 · Cited by 266
Maximal planar networks with large clustering coefficient and power-law degree distribution
Zhou, T., Yan, G., & Wang, B.-H. (2005) · Physical Review E · doi:10.1103/physreve.71.046141 · Cited by 265
Scaling properties of scale-free evolving networks: Continuous approach
Dorogovtsev, S. N., & Mendes, J. F. F. (2001) · Physical Review E · doi:10.1103/physreve.63.056125 · Cited by 258
Self-citation
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
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.