The DOI matches its Crossref record; 18 of the 18 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.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
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
Bollobás, B. (1985) · Cited by 6,196
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Lethality and centrality in protein networks
Jeong, H., Mason, S. P., Barabási, A.-L., & Oltvai, Z. N. (2001) · Nature · doi:10.1038/35075138 · Cited by 5,287
The Large-Scale Organization of Metabolic Networks
Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35036627 · Cited by 4,972
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Random graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
Self-citation
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
Characterization of complex networks: A survey of measurements
Costa, L. D. F., Rodrigues, F. A., Travieso, G., & Villas Boas, P. R. (2007) · Advances in Physics · doi:10.1080/00018730601170527 · Cited by 2,475
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
Graph theoretical analysis of complex networks in the brain
Stam, C. J., & Reijneveld, J. C. (2007) · Nonlinear Biomedical Physics · doi:10.1186/1753-4631-1-3 · Cited by 1,035
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
Leicht, E. A., Holme, P., & Newman, M. E. J. (2006) · Physical Review E · doi:10.1103/physreve.73.026120 · Cited by 916
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
Heterogeneity in Oscillator Networks: Are Smaller Worlds Easier to Synchronize?
Nishikawa, T., Motter, A. E., Lai, Y.-C., & Hoppensteadt, F. C. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.014101 · Cited by 839
Durrett, R. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546594 · Cited by 780
Modeling interactome: scale-free or geometric?
Pržulj, N., Corneil, D. G., & Jurisica, I. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth436 · Cited by 706
Dynamical patterns of epidemic outbreaks in complex heterogeneous networks
Barthélemy, M., Barrat, A., Pastor-Satorras, R., & Vespignani, A. (2005) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2005.01.011 · Cited by 550
Stam, C. J. (2004) · Neuroscience Letters · doi:10.1016/j.neulet.2003.10.063 · Cited by 549
Network synchronization, diffusion, and the paradox of heterogeneity
Motter, A. E., Zhou, C., & Kurths, J. (2005) · Physical Review E · doi:10.1103/physreve.71.016116 · Cited by 546
The phase transition in inhomogeneous random graphs
Bollobás, B., Janson, S., & Riordan, O. (2007) · Random Structures & Algorithms · doi:10.1002/rsa.20168 · Cited by 545
The application of graph theoretical analysis to complex networks in the brain
Reijneveld, J. C., Ponten, S. C., Berendse, H. W., & Stam, C. J. (2007) · Clinical Neurophysiology · doi:10.1016/j.clinph.2007.08.010 · Cited by 522
Amaral, L. A. N., & Ottino, J. M. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00110-5 · Cited by 493
Turing patterns in network-organized activator–inhibitor systems
Nakao, H., & Mikhailov, A. S. (2010) · Nature Physics · doi:10.1038/nphys1651 · Cited by 443
Andrade, J. S., Herrmann, H. J., Andrade, R. F. S., & da Silva, L. R. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.018702 · Cited by 398
The neurocognitive bases of human multimodal food perception: Sensory integration
Verhagen, J. V., & Engelen, L. (2006) · Neuroscience & Biobehavioral Reviews · doi:10.1016/j.neubiorev.2005.11.003 · Cited by 392
Complex Networks: Principles, Methods and Applications
Latora, V., Nicosia, V., & Russo, G. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316216002 · Cited by 372
Percolation on complex networks: Theory and application
Li, M., Liu, R.-R., Lü, L., Hu, M.-B., Xu, S., & Zhang, Y.-C. (2021) · Physics Reports · doi:10.1016/j.physrep.2020.12.003 · Cited by 365
Multilayer Networks: Structure and Function
Bianconi, G. (2018) · doi:10.1093/oso/9780198753919.001.0001 · Cited by 334
Self-Similarity of Complex Networks and Hidden Metric Spaces
Serrano, M. Á., Krioukov, D., & Boguñá, M. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.078701 · Cited by 332
Average path length in random networks
Fronczak, A., Fronczak, P., & Hołyst, J. A. (2004) · Physical Review E · doi:10.1103/physreve.70.056110 · Cited by 326
Enhancing complex-network synchronization
Motter, A. E., Zhou, C. S., & Kurths, J. (2005) · Europhysics Letters (EPL) · doi:10.1209/epl/i2004-10365-4 · Cited by 317
Bipartite graphs as models of complex networks
Guillaume, J.-L., & Latapy, M. (2006) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.04.047 · Cited by 282
Dimension of spatially embedded networks
Daqing, L., Kosmidis, K., Bunde, A., & Havlin, S. (2011) · Nature Physics · doi:10.1038/nphys1932 · Cited by 266
Self-citationExploring complex networks via topological embedding on surfaces
Aste, T., Gramatica, R., & Di Matteo, T. (2012) · Physical Review E · doi:10.1103/physreve.86.036109 · Cited by 33
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
- 18
- 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
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.