The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Network growth by copying
Open accessAbstract
We introduce a growing network model in which a new node attaches to a randomly selected node, as well as to all ancestors of the target node. This mechanism produces a sparse, ultrasmall network where the average node degree grows logarithmically with network size while the network diameter equals 2. We determine basic geometrical network properties, such as the size dependence of the number of links and the in- and out-degree distributions. We also compare our predictions with real networks where the node degree also grows slowly with time--the Internet and the citation network of all Physical Review papers.
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
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Simkin, M. V., Roychowdhury, V. P., & Department of Electrical Engineering, U. O. C. (2024) · Complex Systems · doi:10.25088/complexsystems.14.3.269 · Cited by 192
Cited by
Graph evolution: Densification and shrinking diameters
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217301 · Cited by 2,461
Hyperbolic geometry of complex networks
Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., & Boguñá, M. (2010) · Physical Review E · doi:10.1103/physreve.82.036106 · Cited by 1,059
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
The Matthew effect in empirical data
Perc, M. (2014) · Journal of The Royal Society Interface · doi:10.1098/rsif.2014.0378 · Cited by 456
The science of science: From the perspective of complex systems
Zeng, A., Shen, Z., Zhou, J., Wu, J., Fan, Y., Wang, Y., & Stanley, H. E. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.10.001 · Cited by 410
Metadata
- Authors
- Krapivsky, P. L., & Redner, S.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2005-03-17
- Volume
- 71
- Issue
- 3
- Pages
- 036118-036118
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2171520817
- Cited by
- 175
- References
- 2
- FWCI
- 5.41
- 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: Network growth by copying. https://app.cochat.ai/papers/10.1103/physreve.71.036118
- The paper
- Krapivsky, P. L., & Redner, S. (2005). Network growth by copying. Physical Review E. https://doi.org/10.1103/physreve.71.036118
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.