Average path length in random networks
Open accessThe DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Abstract
Analytic solution for the average path length in a large class of uncorrelated random networks with hidden variables is found. We apply the approach to classical random graphs of Erd\"os and R\'enyi (ER), evolving networks introduced by Barab\'asi and Albert as well as random networks with asymptotic scale-free connectivity distributions characterized by an arbitrary scaling exponent $\ensuremath{\alpha}>2$. Our result for $2<\ensuremath{\alpha}<3$ shows that structural properties of asymptotic scale-free networks including numerous examples of real-world systems are even more intriguing than ultra-small world behavior noticed in pure scale-free structures and for large system sizes $N\ensuremath{\rightarrow}\ensuremath{\infty}$ there is a saturation effect for the average path length.
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
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
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
Table of Integrals, Series, and Products
(1980) · Elsevier eBooks · doi:10.1016/c2013-0-10754-4 · Cited by 18,782
Table of Integrals, Series, and Products
(2000) · Elsevier eBooks · doi:10.1016/b978-0-12-294757-5.x5000-4 · Cited by 8,408
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
An Introduction to Probability Theory and Its Applications.
Bharucha-Reid, A. T., & Feller, W. (1967) · The American Mathematical Monthly · doi:10.2307/2314609 · Cited by 6,066
Cited by
Leicht, E. A., Holme, P., & Newman, M. E. J. (2006) · Physical Review E · doi:10.1103/physreve.73.026120 · Cited by 916
The Small World of Psychopathology
Borsboom, D., Cramer, A. O. J., Schmittmann, V. D., Epskamp, S., & Waldorp, L. J. (2011) · PLoS ONE · doi:10.1371/journal.pone.0027407 · Cited by 591
Physical approach to complex systems
Kwapień, J., & Drożdż, S. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.01.007 · Cited by 517
Metrics for Community Analysis: A Survey
Chakraborty, T., Dalmia, A., Mukherjee, A., & Ganguly, N. (2018) · ACM Computing Surveys · doi:10.1145/3091106 · Cited by 296
Epidemic spreading and cooperation dynamics on homogeneous small-world networks
Santos, F. C., Rodrigues, J. F., & Pacheco, J. M. (2005) · Physical Review E · doi:10.1103/physreve.72.056128 · Cited by 288
McCarthy, P., Benuskova, L., & Franz, E. A. (2014) · Frontiers in Aging Neuroscience · doi:10.3389/fnagi.2014.00301 · Cited by 48
“In an ER graph of size n, the mean path length, l, may be derived from the mean network degree, k, according to l = ln [n]− 0.5772ln [k] + 12 (Fronczak et al., 2004).”
Method
Metadata
- Authors
- Fronczak, A., Fronczak, P., & Hołyst, J. A.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2004-11-17
- Volume
- 70
- Issue
- 5
- Pages
- 056110-056110
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2002727114
- Cited by
- 326
- References
- 49
- FWCI
- 4.78
- 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.