The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Explosive Percolation Is Continuous
Abstract
A mathematical proof shows that in many models of the growth of network connectivity, phase transitions are continuous.
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
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networksPreprint
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · Cited by 6,467
Epidemic Spreading in Scale-Free Networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,731
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
On the evolution of random graphs
Erdös, P., & Rényi, A. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.38 · Cited by 1,757
Efficiency of a Good But Not Linear Set Union Algorithm
Tarjan, R. E. (1975) · Journal of the ACM · doi:10.1145/321879.321884 · Cited by 1,403
The Evolution of Random Graphs
Bollobas, B. (1984) · Transactions of the American Mathematical Society · doi:10.2307/1999405 · Cited by 1,023
Explosive Percolation in Random Networks
Achlioptas, D., D'Souza, R. M., & Spencer, J. (2009) · Science · doi:10.1126/science.1167782 · Cited by 673
How Viruses Spread Among Computers and People
Lloyd, A. L., & May, R. M. (2001) · Science · doi:10.1126/science.1061076 · Cited by 661
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
Self-citationMathematical results on scale‐free random graphs
Bollobás, B., & Riordan, O. M. (2002) · Handbook of Graphs and Networks · doi:10.1002/3527602755.ch1 · Cited by 463
Self-citationAre randomly grown graphs really random?
Callaway, D. S., Hopcroft, J. E., Kleinberg, J. M., Newman, M. E. J., & Strogatz, S. H. (2001) · Physical Review E · doi:10.1103/physreve.64.041902 · Cited by 448
The evolution of random graphs
Bollobás, B. (1984) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1984-0756039-5 · Cited by 415
A Random Graph Model for Power Law Graphs
Aiello, W., Chung, F., & Lu, L. (2001) · Experimental Mathematics · doi:10.1080/10586458.2001.10504428 · Cited by 405
The birth of the giant component
Janson, S., Knuth, D. E., Łuczak, T., & Pittel, B. (1993) · Random Structures & Algorithms · doi:10.1002/rsa.3240040303 · Cited by 389
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
Robustness and Vulnerability of Scale-Free Random Graphs
Bollobás, B., & Riordan, O. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129080 · Cited by 273
Self-citationComponent behavior near the critical point of the random graph process
Łuczak, T. (1990) · Random Structures & Algorithms · doi:10.1002/rsa.3240010305 · Cited by 215
Impact of single links in competitive percolation
Nagler, J., Levina, A., & Timme, M. (2011) · Nature Physics · doi:10.1038/nphys1860 · Cited by 206
Explosive Percolation in Scale-Free Networks
Radicchi, F., & Fortunato, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.168701 · Cited by 178
Construction and Analysis of Random Networks with Explosive Percolation
Friedman, E. J., & Landsberg, A. S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.255701 · Cited by 142
Explosive percolation: A numerical analysis
Radicchi, F., & Fortunato, S. (2010) · Physical Review E · doi:10.1103/physreve.81.036110 · Cited by 128
Spencer, J., & Wormald, N. (2007) · COMBINATORICA · doi:10.1007/s00493-007-2163-2 · Cited by 104
Bohman, T., & FRIEZE, A. M. (2001) · Random Structures and Algorithms · doi:10.1002/rsa.1019 · Cited by 101
Achlioptas process phase transitions are continuous
Riordan, O. M., & Warnke, L. (2012) · The Annals of Applied Probability · doi:10.1214/11-aap798 · Cited by 82
Self-citationBohman, T., & Kravitz, D. (2006) · Combinatorics Probability Computing · doi:10.1017/s0963548306007486 · Cited by 53
The Small Giant Component in Scale-Free Random Graphs
Riordan, O. M. (2005) · Combinatorics Probability Computing · doi:10.1017/s096354830500708x · Cited by 34
Self-citationEmergence of Connectivity in Networks
Bohman, T. (2009) · Science · doi:10.1126/science.1171297 · Cited by 21
Phase transitions for modified Erdős–Rényi processes
Janson, S., & Spencer, J. (2011) · Arkiv för matematik · doi:10.1007/s11512-011-0157-1 · Cited by 19
Cited by
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
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
Metadata
- Authors
- Riordan, O., & Warnke, L.
- Venue
- Science
- Published
- 2011-07-15
- Volume
- 333
- Issue
- 6040
- Pages
- 322-324
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2102626870
- Cited by
- 316
- References
- 30
- FWCI
- 25.14
- 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.