The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Average path length in random networks
Open accessAbstract
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
Epidemic Spreading in Scale-Free Networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,731
(2010) · Introduction to Combinatorics · doi:10.1201/b12336-12 · Cited by 5,632
Tables of Integrals, Series, and Products
Gradshteyn, I. S., Ryzhik, I. M., & Romer, R. H. (1988) · American Journal of Physics · doi:10.1119/1.15756 · Cited by 3,651
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
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Network Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5468 · Cited by 2,480
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
A critical point for random graphs with a given degree sequence
Molloy, M., & Reed, B. (1995) · Random Structures & Algorithms · doi:10.1002/rsa.3240060204 · Cited by 2,351
Mean-field theory for scale-free random networks
Barabási, A.-L., Albert, R., & Jeong, H. (1999) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(99)00291-5 · Cited by 2,255
Hierarchical organization in complex networks
Ravasz, E., & Barabási, A.-L. (2003) · Physical Review E · doi:10.1103/physreve.67.026112 · Cited by 2,160
An Introduction to Probability Theory and Its Applications
Feller, W., & Morse, P. M. (1958) · Physics Today · doi:10.1063/1.3062516 · Cited by 2,040
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
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
Breakdown of the Internet under Intentional Attack
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3682 · Cited by 1,455
Topology of Evolving Networks: Local Events and Universality
Albert, R., & Barabási, A.-L. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5234 · Cited by 1,308
Structure of Growing Networks with Preferential Linking
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4633 · Cited by 1,307
Universal Behavior of Load Distribution in Scale-Free Networks
Goh, K.-I., Kahng, B., & Kim, D. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.278701 · Cited by 1,246
Adamic, L. A., Lukose, R. M., Puniyani, A. R., & Huberman, B. A. (2001) · Physical Review E · doi:10.1103/physreve.64.046135 · Cited by 1,203
Handbook of Graphs and Networks: From the Genome to the Internet
(2002) · Wiley eBooks · doi:10.1002/3527602755 · Cited by 949
Connected Components in Random Graphs with Given Expected Degree Sequences
Chung, F., & Lu, L. (2002) · Annals of Combinatorics · doi:10.1007/pl00012580 · Cited by 938
Wilson, R. J. (1972) · Cited by 926
Organization of growing random networks
Krapivsky, P. L., & Redner, S. (2001) · Physical Review E · doi:10.1103/physreve.63.066123 · Cited by 871
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
Scale-Free Networks Are Ultrasmall
Cohen, R., & Havlin, S. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.058701 · Cited by 815
Scale-Free Networks from Varying Vertex Intrinsic Fitness
Caldarelli, G., Capocci, A., De Los Rios, P., & Muñoz, M. A. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.258702 · Cited by 794
Halting viruses in scale-free networks
Dezső, Z., & Barabási, A.-L. (2002) · Physical Review E · doi:10.1103/physreve.65.055103 · Cited by 583
Class of correlated random networks with hidden variables
Boguñá, M., & Pastor-Satorras, R. (2003) · Physical Review E · doi:10.1103/physreve.68.036112 · Cited by 452
Mean-Field Solution of the Small-World Network Model
Newman, M. E. J., Moore, C., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.84.3201 · Cited by 407
Highly clustered scale-free networks
Klemm, K., & Eguíluz, V. M. (2002) · Physical Review E · doi:10.1103/physreve.65.036123 · Cited by 395
Epidemic Threshold in Structured Scale-Free Networks
Eguíluz, V. M., & Klemm, K. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.108701 · Cited by 353
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
General formalism for inhomogeneous random graphs
Söderberg, B. (2002) · Physical Review E · doi:10.1103/physreve.66.066121 · Cited by 244
Origin of degree correlations in the Internet and other networks
Park, J., & Newman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.68.026112 · Cited by 222
Optimal Paths in Disordered Complex Networks
Braunstein, L. A., Buldyrev, S. V., Cohen, R., Havlin, S., & Stanley, H. E. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.168701 · Cited by 187
Statistical ensemble of scale-free random graphs
Burda, Z., Correia, J. D., & Krzywicki, A. (2001) · Physical Review E · doi:10.1103/physreve.64.046118 · Cited by 175
Path finding strategies in scale-free networks
Kim, B. J., Yoon, C. N., Han, S. K., & Jeong, H. (2002) · Physical Review E · doi:10.1103/physreve.65.027103 · Cited by 174
Critical phenomena in networks
Goltsev, A. V., Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.67.026123 · Cited by 138
Metric structure of random networks
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2003) · Nuclear Physics B · doi:10.1016/s0550-3213(02)01119-7 · Cited by 127
Shortest paths and load scaling in scale-free trees
Szabó, G., Alava, M. J., & Kertész, J. (2002) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.66.026101 · Cited by 90
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
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.