Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 307

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 access
Chung, Fan, Lu, Linyuan · 2004 · Internet Mathematics

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1080/15427951.2004.10129081

Cites

24 of 24 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 24 references

Cited by

See all 307

Metadata

Authors
Chung, F., & Lu, L.
Venue
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.