Issue |
EPL
Volume 130, Number 3, May 2020
|
|
---|---|---|
Article Number | 38003 | |
Number of page(s) | 7 | |
Section | Interdisciplinary Physics and Related Areas of Science and Technology | |
DOI | https://doi.org/10.1209/0295-5075/130/38003 | |
Published online | 05 June 2020 |
Robustness of interdependent networks based on bond percolation
1 School of Electrical and Automation Engineering, East China Jiaotong University - Nanchang, 330013, China
2 Department of Physics, Boston University - Boston, MA 02215, USA
3 Key Laboratory of Image Information Processing and Intelligent Control, School of Artificial Intelligence and Automation, Huazhong University of Science and Technology - Wuhan, 430074, China
4 Department of Computer Science & Network Science and Technology Center, Rensselaer Polytechnic Institute Troy, NY, 12180, USA
5 Department of Physics, Bar- Ilan University - 52900 Ramat- Gan, Israel
Received: 16 March 2020
Accepted: 22 May 2020
Understanding the robustness of interdependent networks has attracted much attention in recent years. In many real scenarios, links may fail instead of nodes and how the interdependent networks behave in this case has not been adequately addressed. In this work, we investigate the link failures propagation mechanism for both two-layer and n-layer interdependent networks by using the self-consistent probabilities method which significantly simplifies the mathematical analysis of such systems. For bond percolation in which initial link failures occur in one layer, we find, analytically and via simulations, that the critical percolation threshold, pc, of this system is lower than that of site percolation. Furthermore, for interdependent ER networks, in contrast to site percolation, bond percolation results show that pc varies nonlinearly with the inverse of average degree. We also find, for the case of bond percolation where initial link failures occur in all layers, that the critical percolation threshold is the same as that of site percolation, but the behavior of the giant component above pc is different. Our research brings insight to better understand the vulnerability of interdependent networks due to link failures.
PACS: 89.75.Hc – Networks and genealogical trees / 89.75.Fb – Structures and organization in complex systems / 64.60.ah – Percolation
© EPLA, 2020
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.