The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Scale-Free Networks Are Ultrasmall
Open accessAbstract
We study the diameter, or the mean distance between sites, in a scale-free network, having N sites and degree distribution p(k) proportional, variant k(-lambda), i.e., the probability of having k links outgoing from a site. In contrast to the diameter of regular random networks or small-world networks, which is known to be d approximately ln(N, we show, using analytical arguments, that scale-free networks with 2 3, d approximately ln(N. We also show that, for any lambda>2, one can construct a deterministic scale-free network with d approximately ln(ln(N, which is the lowest possible diameter.
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
Bose-Einstein Condensation in Complex Networks
Bianconi, G., & Barabási, A.-L. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5632 · Cited by 808
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
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Network biology: understanding the cell's functional organization
Barabási, A.-L., & Oltvai, Z. N. (2004) · Nature Reviews Genetics · doi:10.1038/nrg1272 · Cited by 7,903
Synchronization in complex networks
Arenas, A., Díaz-Guilera, A., Kurths, J., Moreno, Y., & Zhou, C. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.002 · Cited by 3,713
Network ‘Small-World-Ness’: A Quantitative Method for Determining Canonical Network Equivalence
Humphries, M. D., & Gurney, K. (2008) · PLoS ONE · doi:10.1371/journal.pone.0002051 · Cited by 1,442
Analysis of topological characteristics of huge online social networking services
Ahn, Y.-Y., Han, S., Kwak, H., Moon, S., & Jeong, H. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242685 · Cited by 937
Metadata
- Authors
- Cohen, R., & Havlin, S.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2003-02-04
- Volume
- 90
- Issue
- 5
- Pages
- 058701-058701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2119004437
- Cited by
- 815
- References
- 3
- FWCI
- 22.31
- 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: Scale-Free Networks Are Ultrasmall. https://app.cochat.ai/papers/10.1103/physrevlett.90.058701
- The paper
- Cohen, R., & Havlin, S. (2003). Scale-Free Networks Are Ultrasmall. Physical Review Letters. https://doi.org/10.1103/physrevlett.90.058701
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.
