Eradicating Catastrophic Collapse in Interdependent Networks via Reinforced Nodes

Abstract

In interdependent networks, it is usually assumed, based on percolation theory, that nodes become nonfunctional if they lose connection to the network giant component. However, in reality, some nodes, equipped with alternative resources, together with their connected neighbors can still be functioning once disconnected from the giant component. Here we propose and study a generalized percolation model that introduces a fraction of reinforced nodes in the interdependent networks that can function and support their neighborhood. We analyze, both analytically and via simulations, the order parameter$-$the functioning component$-$comprising both the giant component and smaller components that include at least one reinforced node. Remarkably, we find that for interdependent networks, we need to reinforce only a small fraction of nodes to prevent abrupt catastrophic collapses. Moreover, we find that the universal upper bound of this fraction is 0.1756 for two interdependent Erdős-Rényi (ER) networks, regular-random (RR) networks and scale-free (SF) networks with large average degrees. We also generalize our theory to interdependent networks of networks (NON). Our findings might yield insight for designing resilient interdependent infrastructure networks.

arXiv comment12 pages, 6 figures

References in corpus (24)

• Statistical mechanics of complex networks
• Catastrophic cascade of failures in interdependent networks
• The spread of epidemic disease on networks
• The structure and dynamics of multilayer networks
• Resilience of the Internet to random breakdowns
• Structure and tie strengths in mobile communication networks
• 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
• The critical effect of dependency groups on the function of networks
• Avoiding catastrophic failure in correlated networks of networks
• Percolation Theory on Interdependent Networks Based on Epidemic Spreading
• Robustness of a Tree-like Network of Interdependent Networks
• Percolation in real interdependent networks
• Bootstrap Percolation on Complex Networks
• Percolation in Interdependent and Interconnected Networks: Abrupt Change from Second to First Order Transition
• Multiple percolation transitions in a configuration model of network of networks
• Percolation of Interdependent Networks with Inter-similarity
• Percolation of a general network of networks
• Link overlap, viability, and mutual percolation in multiplex networks
• Weak percolation on multiplex networks
• Multiple resource demands and viability in multiplex networks
• Scaling and universality in glass transition
• Fredrickson-Andersen model on Bethe lattice with random pinning

Cited by in corpus (14)

• Resilience of networks with community structure behaves as if under an external field
• Cascading Failures in Complex Networks
• Local structure can identify and quantify influential global spreaders in large scale social networks
• Group percolation in interdependent networks
• Asymmetry in interdependence makes a multilayer system more robust against cascading failures
• Social contagions with communication channels alternation on multiplex networks
• Network Properties for Robust Multilayer Infrastructure Systems: A Percolation Theory Review
• Percolation of Hierarchical Networks and Networks of Networks
• Double transition of information spreading in a two-layered network
• Emergence of Robustness in Network of Networks
• Dependency-based targeted attacks in interdependent networks
• Random node reinforcement and $K$-core structure of complex networks
• Optimization of robustness based on reinforced nodes in a modular network
• Improving robustness of spatial networks via reinforced nodes