Journal
PHYSICAL REVIEW E
Volume 87, Issue 4, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevE.87.043302
Keywords
-
Categories
Funding
- ETH Risk Center
- Swiss National Science Foundation [200021 126853]
- New England UTC Year 23 grant
- NEC Corporation Fund
- Solomon Buchsbaum Research Fund
- Swiss National Science Foundation (SNF) [200021_126853] Funding Source: Swiss National Science Foundation (SNF)
Ask authors/readers for more resources
Interconnected networks have been shown to be much more vulnerable to random and targeted failures than isolated ones, raising several interesting questions regarding the identification and mitigation of their risk. The paradigm to address these questions is the percolation model, where the resilience of the system is quantified by the dependence of the size of the largest cluster on the number of failures. Numerically, the major challenge is the identification of this cluster and the calculation of its size. Here, we propose an efficient algorithm to tackle this problem. We show that the algorithm scales as O(N logN), where N is the number of nodes in the network, a significant improvement compared to O(N-2) for a greedy algorithm, which permits studying much larger networks. Our new strategy can be applied to any network topology and distribution of interdependencies, as well as any sequence of failures. DOI: 10.1103/PhysRevE.87.043302
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available