The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Generating Simple Random Graphs with Prescribed Degree Distribution
Open accessAbstract
Let F be a probability distribution with support on the non-negative integers. Four methods for generating a simple undirected graph with (approximate) degree distribution F are described and compared. Two methods are based on the so called configuration model with modifications ensuring a simple graph, one method is an extension of the classical Erdös-Rényi graph where the edge probabilities are random variables, and the last method starts with a directed random graph which is then modified to a simple undirected graph. All methods are shown to give the correct distribution in the limit of large graph size, but under different assumptions on the degree distribution F and also using different order of operations.
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
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 Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Bollobás, B. (1985) · Cited by 6,196
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
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
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
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639 · cited 1×
“parameters n− 1 and pand, if pis scaled by 1/n, we get a Poisson distribution in the limit as n→ ∞. Erdo˝s-R´enyi graphs have been widely studied and thorough descriptions of the field can be found in [4, 12]. An area that has received a lot of attention within statistical physics during the last few years is the use o…”
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
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
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Janson, S., Łuczak, T., & Rucinski, A. (2000) · Wiley eBooks · doi:10.1002/9781118032718 · Cited by 1,545
The web of human sexual contacts
Liljeros, F., Edling, C., Amaral, L. A. N., Stanley, E., & Åberg, Y. (2001) · RePEc: Research Papers in Economics · Cited by 1,389
The web of human sexual contacts
Liljeros, F., Edling, C. R., Amaral, L. A. N., Stanley, H. E., & Åberg, Y. (2001) · Nature · doi:10.1038/35082140 · Cited by 1,318
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
Bollobás, B. (1980) · European Journal of Combinatorics · doi:10.1016/s0195-6698(80)80030-8 · Cited by 1,151
The asymptotic number of labeled graphs with given degree sequences
Bender, E. A., & Canfield, E. R. (1978) · Journal of Combinatorial Theory, Series A · doi:10.1016/0097-3165(78)90059-6 · Cited by 970
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
The average distances in random graphs with given expected degrees
Chung, F., & Lu, L. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.252631999 · Cited by 885
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
MOLLOY, M., & REED, B. (1998) · Combinatorics, Probability and Computing · doi:10.1017/s0963548398003526 · Cited by 831
General formalism for inhomogeneous random graphs
Söderberg, B. (2002) · Physical Review E · doi:10.1103/physreve.66.066121 · Cited by 244
Uniform generation of random regular graphs of moderate degree
McKay, B. D., & Wormald, N. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90029-e · Cited by 156
Cited by
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
The phase transition in inhomogeneous random graphs
Bollobás, B., Janson, S., & Riordan, O. (2007) · Random Structures & Algorithms · doi:10.1002/rsa.20168 · Cited by 545
Recent advances in percolation theory and its applications
Saberi, A. A. (2015) · Physics Reports · doi:10.1016/j.physrep.2015.03.003 · Cited by 438
A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
Blitzstein, J., & Diaconis, P. (2011) · Internet Mathematics · doi:10.1080/15427951.2010.557277 · Cited by 291
Metadata
- Authors
- Britton, T., Deijfen, M., & Martin-Löf, A.
- Venue
- Journal of Statistical Physics
- Published
- 2006-08-11
- Volume
- 124
- Issue
- 6
- Pages
- 1377-1397
- ISSN
- 0022-4715 (ISSN-L)
- 1572-9613
- OpenAlex
- W2083750870
- Cited by
- 309
- References
- 21
- FWCI
- 8.45
- 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.