The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
The Average Distance in a Random Graph with Given Expected Degrees
Open accessAbstract
Random graph theory is used to examine the "small-world phenomenon"– any two strangers are connected through a short chain of mutual acquaintances. We will show that for certain families of random graphs with given expected degrees, the average distance is almost surely of order log _n_/ log_d̃_ where _d̃_ is the weighted average of the sum of squares of the expected degrees. Of particular interest are power law random graphs in which the number of vertices of degree _k_ is proportional to 1/_k_β for some fixed exponent _β_. For the case of _β_ > 3, we prove that the average distance of the power law graphs is almost surely of order log _n_/ log _d̃_. However, many Internet, social, and citation networks are power law graphs with exponents in the range 2 < β < 3 for which the power law random graphs have average distance almost surely of order log log _n_, but have diameter of order log _n_ (provided having some mild constraints for the average distance and maximum degree). In particular, these graphs contain a dense subgraph, that we call the core, having _n_ c/ log log n vertices. Almost all vertices are within distance log log _n_ of the core although there are vertices at distance log _n_ from the core.
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
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
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
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
The frequency distribution of scientific productivity
Lotka, A. J. (1926) · Journal of the Washington Academy of Sciences · Cited by 2,246
The frequency distribution of scientific productivity
G.F.S. (1926) · Journal of the Franklin Institute · doi:10.1016/s0016-0032(26)91166-6 · Cited by 1,344
Human Behaviour and the Principle of Least Effort.
Florence, P. S., & Zipf, G. K. (1950) · The Economic Journal · doi:10.2307/2226729 · Cited by 1,194
Cited by
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Statistical properties of community structure in large social and information networks
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367591 · Cited by 860
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
Durrett, R. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546594 · Cited by 780
The effect of network topology on the spread of epidemics
Ganesh, A., Massoulie, L., & Towsley, D. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498374 · Cited by 734
Metadata
- Authors
- Chung, F., & Lu, L.
- Venue
- Internet Mathematics
- Publisher
- Internet Mathematics
- Published
- 2004-01
- Volume
- 1
- Issue
- 1
- Pages
- 91-113
- ISSN
- 1542-7951 (ISSN-L)
- 1944-9488
- OpenAlex
- W2068902429
- Cited by
- 307
- References
- 24
- FWCI
- 10.69
- Type
- journal article
- Language
- en
- Open access
- bronze
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: The Average Distance in a Random Graph with Given Expected Degrees. https://app.cochat.ai/papers/10.1080/15427951.2004.10129081
- The paper
- Chung, F., & Lu, L. (2004). The Average Distance in a Random Graph with Given Expected Degrees. Internet Mathematics. https://doi.org/10.1080/15427951.2004.10129081
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.