The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Cascade of failures in coupled network systems with multiple support-dependence relations
Open accessAbstract
We study, both analytically and numerically, the cascade of failures in two coupled network systems A and B, where multiple support-dependence relations are randomly built between nodes of networks A and B. In our model we assume that each node in one network can function only if it has at least a single support link connecting it to a functional node in the other network. We assume that networks A and B have (i) sizes ${N}^{A}$ and ${N}^{B}$, (ii) degree distributions of connectivity links ${P}^{A}(k)$ and ${P}^{B}(k)$, (iii) degree distributions of support links ${\mathrm{P\ifmmode \tilde{}\else \~{}\fi{}}}^{A}(k)$ and ${\mathrm{P\ifmmode \tilde{}\else \~{}\fi{}}}^{B}(k)$, and (iv) random attack removes $(1\ensuremath{-}{R}^{A}){N}^{A}$ and $(1\ensuremath{-}{R}^{B}){N}^{B}$ nodes form the networks A and B, respectively. We find the fractions of nodes ${\ensuremath{\mu}}_{\ensuremath{\infty}}^{A}$ and ${\ensuremath{\mu}}_{\ensuremath{\infty}}^{B}$ which remain functional (giant component) at the end of the cascade process in networks A and B in terms of the generating functions of the degree distributions of their connectivity and support links. In a special case of Erd\ifmmode \mbox{\H{o}}\else \H{o}\fi{}s-R\'enyi networks with average degrees $a$ and $b$ in networks A and B, respectively, and Poisson distributions of support links with average degrees $\mathrm{a\ifmmode \tilde{}\else \~{}\fi{}}$ and $\mathrm{b\ifmmode \tilde{}\else \~{}\fi{}}$ in networks A and B, respectively, ${\ensuremath{\mu}}_{\ensuremath{\infty}}^{A}={R}^{A}[1\ensuremath{-}\mathrm{exp}(\ensuremath{-}\mathrm{a\ifmmode \tilde{}\else \~{}\fi{}}{\ensuremath{\mu}}_{\ensuremath{\infty}}^{B})][1\ensuremath{-}\mathrm{exp}(\ensuremath{-}a{\ensuremath{\mu}}_{\ensuremath{\infty}}^{A})]$ and ${\ensuremath{\mu}}_{\ensuremath{\infty}}^{B}={R}^{B}[1\ensuremath{-}\mathrm{exp}(\ensuremath{-}\mathrm{b\ifmmode \tilde{}\else \~{}\fi{}}{\ensuremath{\mu}}_{\ensuremath{\infty}}^{A})][1\ensuremath{-}\mathrm{exp}(\ensuremath{-}b{\ensuremath{\mu}}_{\ensuremath{\infty}}^{B})]$. In the limit of $\mathrm{a\ifmmode \tilde{}\else \~{}\fi{}}\ensuremath{\rightarrow}\ensuremath{\infty}$ and $\mathrm{b\ifmmode \tilde{}\else \~{}\fi{}}\ensuremath{\rightarrow}\ensuremath{\infty}$, both networks become independent, and our model becomes equivalent to a random attack on a single Erd\ifmmode \mbox{\H{o}}\else \H{o}\fi{}s-R\'enyi network. We also test our theory on two coupled scale-free networks, and find good agreement with the simulations.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
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
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
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Bollobás, B. (1985) · Cited by 6,196
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
Self-citationRandom graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Spread of epidemic disease on networks
Newman, M. E. J. (2002) · Physical Review E · doi:10.1103/physreve.66.016128 · Cited by 3,218
Dynamical Processes on Complex Networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2008) · doi:10.1017/cbo9780511791383 · Cited by 2,704 · cited 1×
“The dependency relation is represented by a link connecting the support node in one network and the dependent node in the other network (“inter-links”).”
BackgroundNetwork 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
Cited by
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
The structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
“[169], it is further allowed to one node in layer α to be interdependent to more than one node in a given layer β, but here (if not explicitly otherwise stated) we make the simplifying assumption that every node in layer α can be interdependent at most to a node in layer β, i.”
BackgroundInfluentialReview on modeling and simulation of interdependent critical infrastructure systems
Ouyang, M. (2014) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2013.06.040 · Cited by 1,262
Networks formed from interdependent networks
Gao, J., Buldyrev, S. V., Stanley, H. E., & Havlin, S. (2012) · Nature Physics · doi:10.1038/nphys2180 · Cited by 1,216
Self-citationRobustness of interdependent networks under targeted attack
Huang, X., Gao, J., Buldyrev, S. V., Havlin, S., & Stanley, H. E. (2011) · Physical Review E · doi:10.1103/physreve.83.065101 · Cited by 527
Self-citationPercolation 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
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
Epidemics on interconnected networks
Dickison, M., Havlin, S., & Stanley, H. E. (2012) · Physical Review E · doi:10.1103/physreve.85.066109 · Cited by 281
Self-citationLi, W., Bashan, A., Buldyrev, S. V., Stanley, H. E., & Havlin, S. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.228702 · Cited by 280
Self-citationSpreading 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
Multilayer networks in a nutshell
Aleta, A., & Moreno, Y. (2019) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-031218-013259 · Cited by 207
Simultaneous first- and second-order percolation transitions in interdependent networks
Zhou, D., Bashan, A., Cohen, R., Berezin, Y., Shnerb, N., & Havlin, S. (2014) · Physical Review E · doi:10.1103/physreve.90.012803 · Cited by 136
Self-citation
Metadata
- Authors
- Shao, J., Buldyrev, S. V., Havlin, S., & Stanley, H. E.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2011-03-29
- Volume
- 83
- Issue
- 3
- Pages
- 036116-036116
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W1879056329
- Cited by
- 432
- References
- 28
- FWCI
- 21.41
- 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.