The DOI matches its Crossref record.
A critical point for random graphs with a given degree sequence
Abstract
Given a sequence of nonnegative real numbers λ 0, λ 1… which sum to 1, we consider random graphs having approximately λ i n vertices of degree i. Essentially, we show that if Σ i(i ‐ 2)λ i > 0, then such graphs almost surely have a giant component, while if Σ i(i ‐2)λ. < 0, then almost surely all components in such graphs are small. We can apply these results to G n,p,G n.M, and other well‐known models of random graphs. There are also applications related to the chromatic number of sparse random graphs.
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
Cited by
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Statistical physics of social dynamics
Castellano, C., Fortunato, S., & Loreto, V. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.591 · Cited by 4,119
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
Measurement and analysis of online social networks
Mislove, A., Marcon, M., Gummadi, K. P., Druschel, P., & Bhattacharjee, B. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298311 · Cited by 3,057
Barthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
Hierarchical structure and the prediction of missing links in networks
Clauset, A., Moore, C., & Newman, M. E. J. (2008) · Nature · doi:10.1038/nature06830 · Cited by 2,171
Community detection in networks: a user guide
Fortunato, S., & Hric, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.09.002 · Cited by 2,086
Dynamic reconfiguration of human brain networks during learning
Bassett, D. S., Wymbs, N. F., Porter, M. A., Mucha, P. J., Carlson, J. M., & Grafton, S. T. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1018985108 · Cited by 1,705
Detecting rich-club ordering in complex networks
Colizza, V., Flammini, A., Serrano, M. A., & Vespignani, A. (2006) · Nature Physics · doi:10.1038/nphys209 · Cited by 1,001
Performance of modularity maximization in practical contexts
Good, B. H., de Montjoye, Y.-A., & Clauset, A. (2010) · Physical Review E · doi:10.1103/physreve.81.046106 · Cited by 937
The Anatomy of the Facebook Social Graph
Ugander, J., Karrer, B., Backstrom, L., & Marlow, C. (2011) · arXiv · doi:10.48550/arxiv.1111.4503 · Cited by 819
Large-scale topological and dynamical properties of the Internet
Vázquez, A., Pastor-Satorras, R., & Vespignani, A. (2002) · Physical Review E · doi:10.1103/physreve.65.066130 · Cited by 712
Activity driven modeling of time varying networks
Perra, N., Gonçalves, B., Pastor-Satorras, R., & Vespignani, A. (2012) · Scientific Reports · doi:10.1038/srep00469 · Cited by 709
The “majority illusion” in social networks
Lerman, K., Yan, X., & Wu, X.-Z. (2016) · PLOS ONE · doi:10.1371/journal.pone.0147617 · Cited by 669
Systematic inequality and hierarchy in faculty hiring networks
Clauset, A., Arbesman, S., & Larremore, D. B. (2015) · Science Advances · doi:10.1126/sciadv.1400005 · Cited by 624
Structure of Urban Movements: Polycentric Activity and Entangled Hierarchical Flows
Roth, C., Kang, S. M., Batty, M., & Barthélemy, M. (2011) · PLoS ONE · doi:10.1371/journal.pone.0015923 · Cited by 461
Robustness of community structure in networks
Karrer, B., Levina, E., & Newman, M. E. J. (2008) · Physical Review E · doi:10.1103/physreve.77.046119 · Cited by 350
On the uniform generation of random graphs with prescribed degree sequences
Milo, R., Kashtan, N., Itzkovitz, S., Newman, M. E. J., & Alon, U. (2003) · arXiv · doi:10.48550/arxiv.cond-mat/0312028 · Cited by 281
Configuring Random Graph Models with Fixed Degree Sequences
Fosdick, B. K., Larremore, D. B., Nishimura, J., & Ugander, J. (2018) · SIAM Review · doi:10.1137/16m1087175 · Cited by 246
Structural Information and Dynamical Complexity of Networks
Li, A., & Pan, Y. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2555904 · Cited by 200
Percolation of localized attack on complex networks
Shao, S., Huang, X., Stanley, H. E., & Havlin, S. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/2/023049 · Cited by 182
No echo in the chambers of political interactions on Reddit
De Francisci Morales, G., Monti, C., & Starnini, M. (2021) · Scientific Reports · doi:10.1038/s41598-021-81531-x · Cited by 98
The Web of False Information: Rumors, Fake News, Hoaxes, Clickbait, and Various Other Shenanigans
Zannettou, S., Sirivianos, M., Blackburn, J., & Kourtellis, N. (2019) · Journal of Data and Information Quality · doi:10.1145/3309699 · Cited by 86
Percolation in self-similar networks
Serrano, M. Á., Krioukov, D., & Boguñá, M. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.048701 · Cited by 47
Information sharing in quantum complex networks
Cardillo, A., Galve, F., Zueco, D., & Gómez-Gardeñes, J. (2013) · Physical Review A · doi:10.1103/physreva.87.052312 · Cited by 17
Metadata
- Authors
- Molloy, M., & Reed, B.
- Venue
- Random Structures & Algorithms
- Publisher
- Wiley
- Published
- 1995-03
- Volume
- 6
- Issue
- 2-3
- Pages
- 161-180
- ISSN
- 1042-9832 (ISSN-L)
- 1098-2418
- OpenAlex
- W2044881936
- Cited by
- 2,351
- References
- 0
- FWCI
- 3.29
- 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
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.
