Random graphs with a given degree sequence
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have graph limits in the sense of Lovász and Szegedy with identifiable limits. This allows simple determination of other features such as the number of triangles. The argument proceeds by studying a natural exponential model having the degree sequence as a sufficient statistic. The maximum likelihood estimate (MLE) of the parameters is shown to be unique and consistent with high probability. Thus n parameters can be consistently estimated based on a sample of size one. A fast, provably convergent, algorithm for the MLE is derived. These ingredients combine to prove the graph limit theorem. Along the way, a continuous version of the Erdős–Gallai characterization of degree sequences is derived.
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
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Representations for partially exchangeable arrays of random variables
Aldous, D. J. (1981) · Journal of Multivariate Analysis · doi:10.1016/0047-259x(81)90099-3 · Cited by 442
Cited by
Matrix estimation by Universal Singular Value Thresholding
Chatterjee, S. (2015) · The Annals of Statistics · doi:10.1214/14-aos1272 · Cited by 465
Self-citationUncovering the genetic blueprint of the C. elegans nervous system
Kovács, I. A., Barabási, D. L., & Barabási, A.-L. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2009093117 · Cited by 42
Uncertainty quantification in the Bradley–Terry–Luce model
Gao, C., Shen, Y., & Zhang, A. Y. (2023) · Information and Inference: A Journal of the IMA · doi:10.1093/imaiai/iaac032 · Cited by 71
Metadata
- Authors
- Chatterjee, S., Diaconis, P., & Sly, A.
- Venue
- The Annals of Applied Probability
- Publisher
- Institute of Mathematical Statistics
- Published
- 2011-08-01
- Volume
- 21
- Issue
- 4
- Pages
- 1400-1435
- ISSN
- 1050-5164 (ISSN-L)
- OpenAlex
- W2086760168
- Cited by
- 166
- References
- 2
- FWCI
- 4.48
- 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
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.