The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Connected Components in Random Graphs with Given Expected Degree Sequences
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
Bollobás, B. (1985) · Cited by 6,196
(2010) · Introduction to Combinatorics · doi:10.1201/b12336-12 · Cited by 5,632
The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.98.2.404 · Cited by 4,482
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
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
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
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
Łuczak, T., Janson, S., & Ruciński, A. (2000) · Cited by 2,192
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Generating Simple Random Graphs with Prescribed Degree Distribution
Britton, T., Deijfen, M., & Martin-Löf, A. (2006) · Journal of Statistical Physics · doi:10.1007/s10955-006-9168-x · Cited by 309
Hierarchy Measure for Complex Networks
Mones, E., Vicsek, L., & Vicsek, T. (2012) · PLoS ONE · doi:10.1371/journal.pone.0033799 · Cited by 259
Generalized Bose-Fermi Statistics and Structural Correlations in Weighted Networks
Garlaschelli, D., & Loffredo, M. I. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.038701 · Cited by 145
Hierarchy in directed random networks
Mones, E. (2013) · Physical Review E · doi:10.1103/physreve.87.022817 · Cited by 16
Metadata
- Authors
- Chung, F., & Lu, L.
- Venue
- Annals of Combinatorics
- Published
- 2002-11
- Volume
- 6
- Issue
- 2
- Pages
- 125-145
- ISSN
- 0218-0006 (ISSN-L)
- OpenAlex
- W2112976607
- Cited by
- 938
- References
- 28
- FWCI
- 28.65
- Type
- journal article
- Language
- en
- Open access
- closed
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: Connected Components in Random Graphs with Given Expected Degree Sequences. https://app.cochat.ai/papers/10.1007/pl00012580
- The paper
- Chung, F., & Lu, L. (2002). Connected Components in Random Graphs with Given Expected Degree Sequences. Annals of Combinatorics. https://doi.org/10.1007/pl00012580
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.
