The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Network Robustness and Fragility: Percolation on Random Graphs
Open accessAbstract
Recent work on the Internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes or links. Such deletions include, for example, the failure of Internet routers or power transmission lines. Percolation models on random graphs provide a simple representation of this process but have typically been limited to graphs with Poisson degree distribution at their vertices. Such graphs are quite unlike real-world networks, which often possess power-law or other highly skewed degree distributions. In this paper we study percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolation, bond percolation, and models in which occupation probabilities depend on vertex degree. We discuss the application of our theory to the understanding of network resilience.
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
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
Bollobás, B. (1985) · Cited by 6,196
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810
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
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
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
Scaling and percolation in the small-world network model
Newman, M. E. J., & Watts, D. J. (1999) · Physical Review E · doi:10.1103/physreve.60.7332 · Cited by 1,202
Self-citationGrowth dynamics of the World-Wide Web
Huberman, B. A., & Adamic, L. A. (1999) · Nature · doi:10.1038/43604 · Cited by 863
Cited by
Items 101–144 of 144
Braunstein, A., Dall’Asta, L., Semerjian, G., & Zdeborová, L. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1605083113 · Cited by 301
Modeling the evolution of weighted networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2004) · Physical Review E · doi:10.1103/physreve.70.066149 · Cited by 300
Threshold Effects for Two Pathogens Spreading on a Network
Newman, M. E. J. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.108701 · Cited by 298
Self-citationResilience of public transport networks against attacks
Berche, B., von Ferber, C., Holovatch, T., & Holovatch, Y. (2009) · The European Physical Journal B · doi:10.1140/epjb/e2009-00291-3 · Cited by 296
Seismic response of critical interdependent networks
Dueñas‐Osorio, L., Craig, J. I., & Goodno, B. J. (2007) · Earthquake Engineering & Structural Dynamics · doi:10.1002/eqe.626 · Cited by 293
Default cascades: When does risk diversification increase stability?
Battiston, S., Gatti, D. D., Gallegati, M., Greenwald, B., & Stiglitz, J. E. (2012) · Journal of Financial Stability · doi:10.1016/j.jfs.2012.01.002 · Cited by 291
Operational resilience: concepts, design and analysis
Ganin, A. A., Massaro, E., Gutfraind, A., Steen, N., Keisler, J. M., Kott, A., Mangoubi, R., & Linkov, I. (2016) · Scientific Reports · doi:10.1038/srep19540 · Cited by 287
Susceptible–infected–recovered epidemics in dynamic contact networks
Volz, E., & Meyers, L. A. (2007) · Proceedings of the Royal Society B: Biological Sciences · doi:10.1098/rspb.2007.1159 · Cited by 286
Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity
Zhou, T., Liu, J.-G., Bai, W.-J., Chen, G., & Wang, B.-H. (2006) · Physical Review E · doi:10.1103/physreve.74.056109 · Cited by 286
Bipartite graphs as models of complex networks
Guillaume, J.-L., & Latapy, M. (2006) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.04.047 · Cited by 282
Synchronization of Kuramoto oscillators in scale-free networks
Moreno, Y., & Pacheco, A. F. (2004) · Europhysics Letters (EPL) · doi:10.1209/epl/i2004-10238-x · Cited by 281
A k-shell decomposition method for weighted networks
Garas, A., Schweitzer, F., & Havlin, S. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/8/083030 · Cited by 280
Technological Networks and the Spread of Computer Viruses
Balthrop, J., Forrest, S., Newman, M. E. J., & Williamson, M. M. (2004) · Science · doi:10.1126/science.1095845 · Cited by 279
Self-citationRobustness of the European power grids under intentional attack
Solé, R. V., Rosas-Casals, M., Corominas-Murtra, B., & Valverde, S. (2008) · Physical Review E · doi:10.1103/physreve.77.026102 · Cited by 279
A framework for investigation into extended enterprise resilience
Erol, O., Sauser, B. J., & Mansouri, M. (2010) · Enterprise Information Systems · doi:10.1080/17517570903474304 · Cited by 278
Anatomy of an online misinformation network
Shao, C., Hui, P.-M., Wang, L., Jiang, X., Flammini, A., Menczer, F., & Ciampaglia, G. L. (2018) · PLOS ONE · doi:10.1371/journal.pone.0196087 · Cited by 278
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
Bianconi, G. (2009) · Physical Review E · doi:10.1103/physreve.79.036114 · Cited by 273
Natural Connectivity of Complex Networks
Jun, W., Barahona, M., Yue-Jin, T., & Hong-Zhong, D. (2010) · Chinese Physics Letters · doi:10.1088/0256-307x/27/7/078902 · Cited by 270
Improved routing strategies for Internet traffic delivery
Echenique, P., Gómez-Gardeñes, J., & Moreno, Y. (2004) · Physical Review E · doi:10.1103/physreve.70.056105 · Cited by 269
Maximal planar networks with large clustering coefficient and power-law degree distribution
Zhou, T., Yan, G., & Wang, B.-H. (2005) · Physical Review E · doi:10.1103/physreve.71.046141 · Cited by 265
Resilience to damage of graphs with degree correlations
Vázquez, A., & Moreno, Y. (2003) · Physical Review E · doi:10.1103/physreve.67.015101 · Cited by 265
Cooperation in Evolving Social Networks
Hanaki, N., Peterhansl, A., Dodds, P. S., & Watts, D. J. (2007) · Management Science · doi:10.1287/mnsc.1060.0625 · Cited by 263
Self-citationEpidemic Spreading in Complex Networks with Degree Correlations
Boguá, M., Pastor-Satorras, R., & Vespignani, A. (2003) · Lecture Notes in Physics · doi:10.1007/978-3-540-44943-0_8 · Cited by 263
Network robustness of multiplex networks with interlayer degree correlations
Min, B., Yi, S. D., Lee, K.-M., & Goh, K.-I. (2014) · Physical Review E · doi:10.1103/physreve.89.042811 · Cited by 262
Scaling properties of scale-free evolving networks: Continuous approach
Dorogovtsev, S. N., & Mendes, J. F. F. (2001) · Physical Review E · doi:10.1103/physreve.63.056125 · Cited by 258
Spreading Processes in Multilayer Networks
Salehi, M., Sharma, R., Marzolla, M., Magnani, M., Siyari, P., & Montesi, D. (2015) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2015.2425961 · Cited by 255
Sandpile on Scale-Free Networks
Goh, K.-I., Lee, D.-S., Kahng, B., & Kim, D. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.148701 · Cited by 255
Spectral Measure of Structural Robustness in Complex Networks
Wu, J., Barahona, M., Tan, Y.-J., & Deng, H.-Z. (2011) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2011.2116117 · Cited by 254
Competing epidemics on complex networks
Karrer, B., & Newman, M. E. J. (2011) · Physical Review E · doi:10.1103/physreve.84.036106 · Cited by 254
Self-citationMisery Loves Company: The Spread of Negative Impacts Resulting from an Organizational Crisis
Yu, T., Sengul, M., & Lester, R. H. (2008) · Academy of Management Review · doi:10.5465/amr.2008.31193499 · Cited by 253
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
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
Spectral Entropies as Information-Theoretic Tools for Complex Network Comparison
De Domenico, M., & Biamonte, J. (2016) · Physical Review X · doi:10.1103/physrevx.6.041062 · Cited by 160
Complex networks from classical to quantum
Biamonte, J., Faccin, M., & De Domenico, M. (2019) · Communications Physics · doi:10.1038/s42005-019-0152-6 · Cited by 149
Competing for Attention in Social Media under Information Overload Conditions
Feng, L., Hu, Y., Li, B., Stanley, H. E., Havlin, S., & Braunstein, L. A. (2015) · PLOS ONE · doi:10.1371/journal.pone.0126090 · Cited by 133
Entanglement Percolation in Quantum Complex Networks
Cuquet, M., & Calsamiglia, J. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.240503 · Cited by 90
Hart, M. G., Ypma, R. J. F., Romero-Garcia, R., Price, S. J., & Suckling, J. (2016) · Journal of Neurosurgery · doi:10.3171/2015.4.jns142683 · Cited by 74
Local leaders in random networks
Blondel, V. D., Guillaume, J.-L., Hendrickx, J. M., de Kerchove, C., & Lambiotte, R. (2008) · Physical Review E · doi:10.1103/physreve.77.036114 · Cited by 69
Geometric robustness theory and biological networks
AY, N., & KRAKAUER, D. (2006) · Theory in Biosciences · doi:10.1016/j.thbio.2006.06.002 · Cited by 45
Insights into bootstrap percolation: Its equivalence with k-core percolation and the giant component
Di Muro, M. A., Valdez, L. D., Stanley, H. E., Buldyrev, S. V., & Braunstein, L. A. (2019) · Physical Review E · doi:10.1103/physreve.99.022311 · Cited by 18
Zanin, M., & Wandelt, S. (2023) · Journal of the Air Transport Research Society · doi:10.59521/5e2ddec9fad4593b · Cited by 18
Quantum Google algorithm: Construction and application to complex networks
Paparo, G. D., Müller, M., Comellas, F., & Martin-Delgado, M. A. (2014) · The European Physical Journal Plus · doi:10.1140/epjp/i2014-14150-y · Cited by 17
Single-cell systems analysis: decision geometry in outliers
Abrahams, L. (2021) · Bioinformatics · doi:10.1093/bioinformatics/btaa1078 · Cited by 3
Metadata
- Authors
- Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2000-12-18
- Volume
- 85
- Issue
- 25
- Pages
- 5468-5471
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2070207525
- Cited by
- 2,480
- References
- 15
- FWCI
- 22.53
- 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.