Algorithm to determine the percolation largest component in interconnected networks
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 resilien...
Main Authors: | Herrmann, Hans J., Schneider, Christian Michael, Araujo, Nuno |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Civil and Environmental Engineering |
Format: | Article |
Language: | en_US |
Published: |
American Physical Society
2014
|
Online Access: | http://hdl.handle.net/1721.1/88997 |
Similar Items
-
Percolation on feature-enriched interconnected systems
by: Oriol Artime, et al.
Published: (2021-04-01) -
Percolation behaviors of finite components on complex networks
by: Fan Wang, et al.
Published: (2022-01-01) -
Decomposing the percolation backbone reveals novel scaling laws of the current distribution
by: Wagner R. de Sena, et al.
Published: (2023-12-01) -
Towards designing robust coupled networks
by: Yazdani, Nuri, et al.
Published: (2014) -
Bond Percolation on Multiplex Networks
by: A. Hackett, et al.
Published: (2016-04-01)