Percolation of Partially Interdependent Scale-free Networks
arXiv:1206.2427 · doi:10.1103/PhysRevE.87.052812
Abstract
We study the percolation behavior of two interdependent scale-free (SF) networks under random failure of 1- fraction of nodes. Our results are based on numerical solutions of analytical expressions and simulations. We find that as the coupling strength between the two networks reduces from 1 (fully coupled) to 0 (no coupling), there exist two critical coupling strengths and , which separate three different regions with different behavior of the giant component as a function of . (i) For , an abrupt collapse transition occurs at . (ii) For , the giant component has a hybrid transition combined of both, abrupt decrease at a certain followed by a smooth decrease to zero for as decreases to zero. (iii) For , the giant component has a continuous second-order transition (at ). We find that for , ; and for , decreases with increasing . In the hybrid transition, at the region, the mutual giant component jumps discontinuously at to a very small but non-zero value, and when reducing , continuously approaches to 0 at for and at for . Thus, the known theoretical for a single network with is expected to be valid also for strictly partial interdependent networks.
arXiv comment20 pages, 17 figures
References in corpus (24)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Catastrophic cascade of failures in interdependent networks
- The spread of epidemic disease on networks
- Resilience of the Internet to random breakdowns
- Self-similarity of complex networks
- Breakdown of the Internet under intentional attack
- Interdependent networks: Reducing the coupling strength leads to a change from a first to second order percolation transition
- Network Physiology reveals relations between network topology and physiological function
- Robustness of a Network of Networks
- Origins of fractality in the growth of complex networks
- Interdependent network reciprocity in evolutionary games
- Are randomly grown graphs really random?
- Avalanche Collapse of Interdependent Network
- The critical effect of dependency groups on the function of networks
- Transport on coupled spatial networks
- Robustness of a Tree-like Network of Interdependent Networks
- Assortativity Decreases the Robustness of Interdependent Networks
- Bootstrap Percolation on Complex Networks
- Percolation in Interdependent and Interconnected Networks: Abrupt Change from Second to First Order Transition
- Enhancing network robustness for malicious attacks
- Structure of shells in complex networks
- Evolution of robust network topologies: Emergence of central backbones
- Fractal Boundaries of Complex Networks
Cited by in corpus (17)
- Multilayer Networks
- The structure and dynamics of multilayer networks
- Evolutionary games on multilayer networks: A colloquium
- Percolation on complex networks: Theory and application
- Percolation of a general network of networks
- Triple Point in Correlated Interdependent Networks
- Critical dynamics of the k-core pruning process
- Efficient algorithm to compute mutually connected components in interdependent networks
- Triple point induced by targeted autonomization on interdependent scale free networks
- Percolation on networks with weak and heterogeneous dependency
- Generalized model for -core percolation and interdependent networks
- The effect of randomness for dependency map on the robustness of interdependent lattices
- Universality and scaling laws in the cascading failure model with healing
- Resilience of antagonistic networks with regard to the effects of initial failures and degree-degree correlations
- Synchronization in interacting Scale Free Networks
- Recovery of Interdependent Networks
- Modeling and Analysis of Cascading Failures in Interdependent Cyber-Physical Systems