The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Explosive Percolation in Random Networks
Abstract
Networks in which the formation of connections is governed by a random process often undergo a percolation transition, wherein around a critical point, the addition of a small number of connections causes a sizable fraction of the network to suddenly become linked together. Typically such transitions are continuous, so that the percentage of the network linked together tends to zero right above the transition point. Whether percolation transitions could be discontinuous has been an open question. Here, we show that incorporating a limited amount of choice in the classic Erdös-Rényi network formation model causes its percolation transition to become discontinuous.
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
Random graph models of social networks
Newman, M. E. J., Watts, D. J., & Strogatz, S. H. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.012582999 · Cited by 1,326
Fast Monte Carlo algorithm for site or bond percolation
Newman, M. E. J., & Ziff, R. M. (2001) · Physical Review E · doi:10.1103/physreve.64.016706 · Cited by 536
Spencer, J., & Wormald, N. (2007) · COMBINATORICA · doi:10.1007/s00493-007-2163-2 · Cited by 104
Self-citationBohman, T., & FRIEZE, A. M. (2001) · Random Structures and Algorithms · doi:10.1002/rsa.1019 · Cited by 101
Hamiltonicity thresholds in Achlioptas processes
Krivelevich, M., Lubetzky, E., & Sudakov, B. (2010) · Random Structures and Algorithms · doi:10.1002/rsa.20302 · Cited by 32
Cited by
Catastrophic cascade of failures in interdependent networks
Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E., & Havlin, S. (2010) · Nature · doi:10.1038/nature08932 · Cited by 4,513
Globally networked risks and how to respond
Helbing, D. (2013) · Nature · doi:10.1038/nature12047 · Cited by 1,281
Qin, F., & Brosseau, C. (2012) · Journal of Applied Physics · doi:10.1063/1.3688435 · Cited by 1,202
The Kuramoto model in complex networks
Rodrigues, F. A., Peron, T. K. D., Ji, P., & Kurths, J. (2016) · Physics Reports · doi:10.1016/j.physrep.2015.10.008 · Cited by 1,040
The physics of higher-order interactions in complex systems
Battiston, F., Amico, E., Barrat, A., Bianconi, G., Ferraz de Arruda, G., Franceschiello, B., Iacopini, I., Kéfi, S., Latora, V., Moreno, Y., et al. (2021) · Nature Physics · doi:10.1038/s41567-021-01371-4 · Cited by 932
Statistical physics of vaccination
Wang, Z., Bauch, C. T., Bhattacharyya, S., d'Onofrio, A., Manfredi, P., Perc, M., Perra, N., Salathé, M., & Zhao, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.10.006 · Cited by 872
Explosive Synchronization Transitions in Scale-Free Networks
Gómez-Gardeñes, J., Gómez, S., Arenas, A., & Moreno, Y. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.128701 · Cited by 674
Robustness and resilience of complex networks
Artime, O., Grassia, M., De Domenico, M., Gleeson, J. P., Makse, H. A., Mangioni, G., Perc, M., & Radicchi, F. (2024) · Nature Reviews Physics · doi:10.1038/s42254-023-00676-y · Cited by 672
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
Percolation on complex networks: Theory and application
Li, M., Liu, R.-R., Lü, L., Hu, M.-B., Xu, S., & Zhang, Y.-C. (2021) · Physics Reports · doi:10.1016/j.physrep.2020.12.003 · Cited by 365
Explosive transitions in complex networks’ structure and dynamics: Percolation and synchronization
Boccaletti, S., Almendral, J. A., Guan, S., Leyva, I., Liu, Z., Sendiña-Nadal, I., Wang, Z., & Zou, Y. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.10.004 · Cited by 363
Explosive Percolation Is Continuous
Riordan, O., & Warnke, L. (2011) · Science · doi:10.1126/science.1206241 · Cited by 316
Critical effect of dependency groups on the function of networks
Parshani, R., Buldyrev, S. V., & Havlin, S. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1008404108 · Cited by 303
Explosive Percolation Transition is Actually Continuous
da Costa, R. A., Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.255701 · Cited by 287
Preferential Attachment, Homophily, and the Structure of International Networks, 1816–2003
Maoz, Z. (2012) · Conflict Management and Peace Science · doi:10.1177/0738894212443344 · Cited by 80
“Such networks are said to ‘‘percolate’’ quickly, creating one giant component (Achlioptas et al., 2009).”
Metadata
- Authors
- Achlioptas, D., D'Souza, R. M., & Spencer, J.
- Venue
- Science
- Published
- 2009-03-13
- Volume
- 323
- Issue
- 5920
- Pages
- 1453-1455
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2093333368
- Cited by
- 673
- References
- 5
- FWCI
- 28.49
- 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.