TY - JOUR
T1 - Robust-yet-fragile nature of interdependent networks
AU - Tan, Fei
AU - Xia, Yongxiang
AU - Wei, Zhi
N1 - Publisher Copyright:
© 2015 American Physical Society.
PY - 2015/5/18
Y1 - 2015/5/18
N2 - Interdependent networks have been shown to be extremely vulnerable based on the percolation model. Parshani et al. [Europhys. Lett. 92, 68002 (2010)EULEEJ0295-507510.1209/0295-5075/92/68002] further indicated that the more intersimilar networks are, the more robust they are to random failures. When traffic load is considered, how do the coupling patterns impact cascading failures in interdependent networks? This question has been largely unexplored until now. In this paper, we address this question by investigating the robustness of interdependent Erdös-Rényi random graphs and Barabási-Albert scale-free networks under either random failures or intentional attacks. It is found that interdependent Erdös-Rényi random graphs are robust yet fragile under either random failures or intentional attacks. Interdependent Barabási-Albert scale-free networks, however, are only robust yet fragile under random failures but fragile under intentional attacks. We further analyze the interdependent communication network and power grid and achieve similar results. These results advance our understanding of how interdependency shapes network robustness.
AB - Interdependent networks have been shown to be extremely vulnerable based on the percolation model. Parshani et al. [Europhys. Lett. 92, 68002 (2010)EULEEJ0295-507510.1209/0295-5075/92/68002] further indicated that the more intersimilar networks are, the more robust they are to random failures. When traffic load is considered, how do the coupling patterns impact cascading failures in interdependent networks? This question has been largely unexplored until now. In this paper, we address this question by investigating the robustness of interdependent Erdös-Rényi random graphs and Barabási-Albert scale-free networks under either random failures or intentional attacks. It is found that interdependent Erdös-Rényi random graphs are robust yet fragile under either random failures or intentional attacks. Interdependent Barabási-Albert scale-free networks, however, are only robust yet fragile under random failures but fragile under intentional attacks. We further analyze the interdependent communication network and power grid and achieve similar results. These results advance our understanding of how interdependency shapes network robustness.
UR - http://www.scopus.com/inward/record.url?scp=84930224778&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84930224778&partnerID=8YFLogxK
U2 - 10.1103/PhysRevE.91.052809
DO - 10.1103/PhysRevE.91.052809
M3 - Article
AN - SCOPUS:84930224778
SN - 1063-651X
VL - 91
JO - Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics
JF - Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics
IS - 5
M1 - 052809
ER -