The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Universal robustness characteristic of weighted networks against cascading failure
Open accessAbstract
We investigate the cascading failure on weighted complex networks by adopting a local weighted flow redistribution rule, where the weight of an edge is (k(i)k(j))theta with k(i) and k(j) being the degrees of the nodes connected by the edge. Assume that a failed edge leads only to a redistribution of the flow passing through it to its neighboring edges. We found that the weighted complex network reaches the strongest robustness level when the weight parameter theta=1, where the robustness is quantified by a transition from normal state to collapse. We determined that this is a universal phenomenon for all typical network models, such as small-world and scale-free networks. We then confirm by theoretical predictions this universal robustness characteristic observed in simulations. We furthermore explore the statistical characteristics of the avalanche size of a network, thus obtaining a power-law avalanche size distribution together with a tunable exponent by varying theta. Our findings have great generality for characterizing cascading-failure-induced disasters in nature.
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
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
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Self-organized criticality: An explanation of the 1/f noise
Bak, P., Tang, C., & Wiesenfeld, K. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.381 · Cited by 7,591
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
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
Bak, P., Tang, C., & Wiesenfeld, K. (1988) · Physical Review A · doi:10.1103/physreva.38.364 · Cited by 4,713
The architecture of complex weighted networks
Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400087101 · Cited by 4,218
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Network Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5468 · Cited by 2,480
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
Congestion avoidance and control
Jacobson, V. (1988) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52356 · Cited by 1,955
Cascade-based attacks on complex networks
Motter, A. E., & Lai, Y.-C. (2002) · Physical Review E · doi:10.1103/physreve.66.065102 · Cited by 1,929
Attack vulnerability of complex networks
Holme, P., Kim, B. J., Yoon, C. N., & Han, S. K. (2002) · Physical Review E · doi:10.1103/physreve.65.056109 · Cited by 1,891
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
Model for cascading failures in complex networks
Crucitti, P., Latora, V., & Marchiori, M. (2004) · Physical Review E · doi:10.1103/physreve.69.045104 · Cited by 1,167
Cascade Control and Defense in Complex Networks
Motter, A. E. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.098701 · Cited by 776
Velocity and Hierarchical Spread of Epidemic Outbreaks in Scale-Free Networks
Barthélemy, M., Barrat, A., Pastor-Satorras, R., & Vespignani, A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.178701 · Cited by 719
Absence of Epidemic Threshold in Scale-Free Networks with Degree Correlations
Boguñá, M., Pastor-Satorras, R., & Vespignani, A. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.028701 · Cited by 548
Network synchronization, diffusion, and the paradox of heterogeneity
Motter, A. E., Zhou, C., & Kurths, J. (2005) · Physical Review E · doi:10.1103/physreve.71.016116 · Cited by 546
Universality in the Synchronization of Weighted Random Networks
Zhou, C., Motter, A. E., & Kurths, J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.034101 · Cited by 340
Attack vulnerability of scale-free networks due to cascading breakdown
Zhao, L., Park, K., & Lai, Y.-C. (2004) · Physical Review E · doi:10.1103/physreve.70.035101 · Cited by 311
Stability and Topology of Scale-Free Networks under Attack and Defense Strategies
Gallos, L. K., Cohen, R., Argyrakis, P., Bunde, A., & Havlin, S. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.188701 · Cited by 310
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
Disturbances in a power transmission system
Sachtjen, M. L., Carreras, B. A., & Lynch, V. E. (2000) · Physical Review E · doi:10.1103/physreve.61.4877 · Cited by 244
Instability of scale-free networks under node-breaking avalanches
Moreno, Y., Gómez, J. B., & Pacheco, A. F. (2002) · Europhysics Letters (EPL) · doi:10.1209/epl/i2002-00442-2 · Cited by 238
Vertex overload breakdown in evolving networks
Holme, P., & Kim, B. J. (2002) · Physical Review E · doi:10.1103/physreve.65.066109 · Cited by 235
Critical load and congestion instabilities in scale-free networks
Moreno, Y., Pastor-Satorras, R., Vázquez, A., & Vespignani, A. (2003) · Europhysics Letters (EPL) · doi:10.1209/epl/i2003-00140-7 · Cited by 199
Dynamical properties of model communication networks
Guimerà, R., Arenas, A., Díaz-Guilera, A., & Giralt, F. (2002) · Physical Review E · doi:10.1103/physreve.66.026704 · Cited by 190
Tolerance of scale-free networks against attack-induced cascades
Zhao, L., Park, K., Lai, Y., & Ye, N. (2005) · Physical Review E · doi:10.1103/physreve.72.025104 · Cited by 129
Minimum spanning trees of weighted scale-free networks
Macdonald, P. J., Almaas, E., & Barabási, A.-Ĺ. (2005) · Europhysics Letters (EPL) · doi:10.1209/epl/i2005-10232-x · Cited by 122
A high-robustness and low-cost model for cascading failures
Wang, B., & Kim, B. J. (2007) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/78/48001 · Cited by 114
Proactive Robustness Control of Heterogeneously Loaded Networks
Schäfer, M., Scholz, J., & Greiner, M. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.108701 · Cited by 84
Universality Class of the Fiber Bundle Model on Complex Networks
Kim, D., Kim, B. J., & Jeong, H. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.025501 · Cited by 73
Korniss, G. (2007) · Physical Review E · doi:10.1103/physreve.75.051121 · Cited by 69
Comment on “Breakdown of the Internet under Intentional Attack”
Dorogovtsev, S. N., & Mendes, J. F. F. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.219801 · Cited by 47
Geographical effects on cascading breakdowns of scale-free networks
Huang, L., Yang, L., & Yang, K. (2006) · Physical Review E · doi:10.1103/physreve.73.036102 · Cited by 47
Recursive weighted treelike networks
Zhang, Z., Zhou, S., Chen, L., Guan, J., Fang, L., & Zhang, Y. (2007) · The European Physical Journal B · doi:10.1140/epjb/e2007-00264-6 · Cited by 22
Phase transition in the modified fiber bundle model
Kim, B. J. (2004) · Europhysics Letters (EPL) · doi:10.1209/epl/i2004-10038-4 · Cited by 18
Cited by
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
Cascade-based attack vulnerability on the US power grid
Wang, J.-W., & Rong, L.-L. (2009) · Safety Science · doi:10.1016/j.ssci.2009.02.002 · Cited by 422
Power grid vulnerability: A complex network approach
Arianos, S., Bompard, E., Carbone, A., & Xue, F. (2009) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.3077229 · Cited by 361
Signal propagation in complex networks
Ji, P., Ye, J., Mu, Y., Lin, W., Tian, Y., Hens, C., Perc, M., Tang, Y., Sun, J., & Kurths, J. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.03.005 · Cited by 360
A Critical Review of Robustness in Power Grids Using Complex Networks Concepts
Cuadra, L., Salcedo-Sanz, S., Del Ser, J., Jiménez-Fernández, S., & Geem, Z. (2015) · Energies · doi:10.3390/en8099211 · Cited by 277
Metadata
- Authors
- Wang, W.-X., & Chen, G.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2008-02-01
- Volume
- 77
- Issue
- 2
- Pages
- 026101-026101
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2080731084
- Cited by
- 325
- References
- 40
- FWCI
- 12.57
- 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.