Cavity-based robustness analysis of interdependent networks: Influences of intranetwork and internetwork degree-degree correlations
arXiv:1308.1210 · doi:10.1103/PhysRevE.89.012808
Abstract
We develop a methodology for analyzing the percolation phenomena of two mutually coupled (interdependent) networks based on the cavity method of statistical mechanics. In particular, we take into account the influence of degree-degree correlations inside and between the networks on the network robustness against targeted attacks and random failures. We show that the developed methodology is reduced to the well-known generating function formalism in the absence of degree-degree correlations. The validity of the developed methodology is confirmed by a comparison with the results of numerical experiments. Our analytical results imply that the robustness of the interdependent networks depends considerably on both the intra- and internetwork degree-degree correlations in the case of targeted attacks, whereas the significance of the degree-degree correlations is relatively low for random failures.
arXiv comment12 pages, 6 figures
References in corpus (22)
- Statistical mechanics of complex networks
- Assortative mixing in networks
- Catastrophic cascade of failures in interdependent networks
- Random graphs with arbitrary degree distributions and their applications
- Network robustness and fragility: Percolation on random graphs
- The Bethe lattice spin glass revisited
- Interdependent networks: Reducing the coupling strength leads to a change from a first to second order percolation transition
- Robustness of a Network of Networks
- The phase transition in inhomogeneous random graphs
- Avalanche Collapse of Interdependent Network
- Evolution of public cooperation on interdependent networks: The impact of biased utility functions
- Inter-similarity between coupled networks
- Transport on coupled spatial networks
- Interdependent networks with correlated degrees of mutually dependent nodes
- Assortativity Decreases the Robustness of Interdependent Networks
- Optimization of Robustness of Complex Networks
- Two-Peak and Three-Peak Optimal Complex Networks
- Robustness of onion-like correlated networks against targeted attacks
- Are Percolation Transitions always Sharpened by Making Networks Interdependent?
- Cavity analysis on the robustness of random networks against targeted attacks: Influences of degree-degree correlations
- Efficient algorithm to study interconnected networks
- Percolation on correlated random networks
Cited by in corpus (19)
- Multilayer Networks
- The structure and dynamics of multilayer networks
- Evolutionary games on multilayer networks: A colloquium
- Multiple percolation transitions in a configuration model of network of networks
- Redundant interdependencies boost the robustness of multilayer networks
- Cascading Failures in Complex Networks
- Message passing theory for percolation models on multiplex networks with link overlap
- Optimal percolation on multiplex networks
- Bond percolation on multiplex networks
- Two distinct transitions in spatially embedded multiplex networks
- Mutually connected component of network of networks with replica nodes
- Multiplex networks with heterogeneous activities of the nodes
- The theory of percolation on hypergraphs
- Fluctuations in percolation of sparse complex networks
- Efficient algorithm to compute mutually connected components in interdependent networks
- Percolation transitions in the survival of interdependent agents on multiplex networks, catastrophic cascades, and SOS
- Observability transition in multiplex networks
- Resilience of antagonistic networks with regard to the effects of initial failures and degree-degree correlations
- Fault Tolerance of Random Graphs with respect to Connectivity: Mean-field Approximation for Semi-dense Random Graphs