Algorithm to determine the percolation largest component in interconnected networks
Name
Schneider-2013-Algorithm to determine.pdf
Size
756.65 KB
Format
Adobe PDF
Checksum (MD5)
1bb5574311e6d7e663bbedb4e76800ee
Author(s)
Herrmann, Hans J.
Schneider, Christian Michael
Araujo, Nuno
Date Issued
April 2013
Journal
Physical Review E
Publisher
American Physical Society
Citation
Schneider, Christian, Nuno Araujo, and Hans Herrmann. “Algorithm to Determine the Percolation Largest Component in Interconnected Networks.” Phys. Rev. E 87, no. 4 (April 2013). © 2013 American Physical Society
Version
Final published version
Abstract
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 log N), where N is the number of nodes in the network, a significant improvement compared to O(N[superscript 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.
MIT Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1103/PhysRevE.87.043302
