Percolation Transitions Are Not Always Sharpened by Making Networks Interdependent
Authors:
- Peter GrassbergerPGPeter Grassberger
- Maya PaczuskiMPMaya Paczuski
- 4 November 2011
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 107 (19) , 195702
Abstract
We study a model for coupled networks introduced recently by Buldyrev et~al., [Nature (London) 464, 1025 (2010)], where each node has to be connected to others via two types of links to be viable. Removing a critical fraction of nodes leads to a percolation transition that has been claimed to be more abrupt than that for uncoupled networks. Indeed, it was found to be discontinuous in all cases studied. Using an efficient new algorithm we verify that the transition is discontinuous for coupled Erd\"os-R\'enyi networks, but find it to be continuous for fully interdependent diluted lattices. In 2 and 3 dimensions, the order parameter exponent $\beta${} is larger than in ordinary percolation, showing that the transition is less sharp, i.e., further from discontinuity, than for isolated networks. Possible consequences for spatially embedded networks are discussed.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Explosive Percolation with Multiple Giant ComponentsPhysical Review Letters, 2011
- A new route to Explosive PercolationPhysica A: Statistical Mechanics and its Applications, 2011
- Explosive Percolation Transition is Actually ContinuousPhysical Review Letters, 2010
- Catastrophic cascade of failures in interdependent networksNature, 2010
- Explosive Percolation in Random NetworksScience, 2009
- Modelling interdependent infrastructures using interacting dynamical modelsInternational Journal of Critical Infrastructures, 2008
- Threshold Effects for Two Pathogens Spreading on a NetworkPhysical Review Letters, 2005
- Monte Carlo study of the site-percolation model in two and three dimensionsPhysical Review E, 2005
- Cascade Control and Defense in Complex NetworksPhysical Review Letters, 2004
- Fast Monte Carlo algorithm for site or bond percolationPhysical Review E, 2001