The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Interdependent networks with identical degrees of mutually dependent nodes
Open accessAbstract
We study a problem of failure of two interdependent networks in the case of identical degrees of mutually dependent nodes. We assume that both networks (A and B) have the same number of nodes N connected by the bidirectional dependency links establishing a one-to-one correspondence between the nodes of the two networks in a such a way that the mutually dependent nodes have the same number of connectivity links; i.e., their degrees coincide. This implies that both networks have the same degree distribution P(k). We call such networks correspondently coupled networks (CCNs). We assume that the nodes in each network are randomly connected. We define the mutually connected clusters and the mutual giant component as in earlier works on randomly coupled interdependent networks and assume that only the nodes that belong to the mutual giant component remain functional. We assume that initially a 1-p fraction of nodes are randomly removed because of an attack or failure and find analytically, for an arbitrary P(k), the fraction of nodes μ(p) that belong to the mutual giant component. We find that the system undergoes a percolation transition at a certain fraction p=p(c), which is always smaller than p(c) for randomly coupled networks with the same P(k). We also find that the system undergoes a first-order transition at p(c)>0 if P(k) has a finite second moment. For the case of scale-free networks with 2<λ≤3, the transition becomes a second-order transition. Moreover, if λ<3, we find p(c)=0, as in percolation of a single network. For λ=3 we find an exact analytical expression for p(c)>0. Finally, we find that the robustness of CCN increases with the broadness of their degree distribution.
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
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Parshani, R., Buldyrev, S. V., & Havlin, S. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.048701 · Cited by 788
Self-citation
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
“[183] considered multiplex networks in which the replica nodes have the same degree.”
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 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
Metadata
- Authors
- Buldyrev, S. V., Shere, N. W., & Cwilich, G. A.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2011-01-27
- Volume
- 83
- Issue
- 1
- Pages
- 016112-016112
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W1650742658
- Cited by
- 248
- References
- 2
- FWCI
- 16.93
- 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.