Robustness of a Network of Networks

@article{Gao2011RobustnessOA,
  title={Robustness of a Network of Networks},
  author={Jianxi Gao and S. Buldyrev and S. Havlin and H. Stanley},
  journal={Physical review letters},
  year={2011},
  volume={107 19},
  pages={
          195701
        }
}
Network research has been focused on studying the properties of a single isolated network, which rarely exists. We develop a general analytical framework for studying percolation of n interdependent networks. We illustrate our analytical solutions for three examples: (i) For any tree of n fully dependent Erdős-Rényi (ER) networks, each of average degree k, we find that the giant component is P∞ =p[1-exp(-kP∞)](n) where 1-p is the initial fraction of removed nodes. This general result coincides… Expand
Percolation of a general network of networks.
TLDR
An analytical framework and analysis of the percolation properties of a network composed of interdependent networks (NetONet) and the extremely vulnerable feedback condition of coupling are developed, where the coupling between nodes of different networks is not one-to-one correspondence. Expand
Percolation of interdependent network of networks
Complex networks appear in almost every aspect of science and technology. Previous work in network theory has focused primarily on analyzing single networks that do not interact with other networks,Expand
Robustness of a network formed by n interdependent networks with a one-to-one correspondence of dependent nodes.
TLDR
This work develops an analytical framework for studying a network formed by n fully interdependent randomly connected networks, each composed of the same number of nodes N, and finds that the robustness of n coupled RR networks of degree k is dramatically higher compared to the n-coupled ER networks of thesame average degree k[over ¯]=k. Expand
Robustness of a network formed of spatially embedded networks.
TLDR
The theory proposed here requires only numerical knowledge about the percolation behavior of a single network and therefore can be used to find the robustness of any network of networks where the profile of percolations of a singe network is known numerically. Expand
Network of Interdependent Networks: Overview of Theory and Applications
Complex networks appear in almost every aspect of science and technology. Previous work in network theory has focused primarily on analyzing single networks that do not interact with other networks,Expand
Robustness of Network of Networks with Interdependent and Interconnected links
TLDR
This work develops a framework to study analytically and numerically the robustness of network of networks with interdependent and interconnected links and finds that increasing intra-connectivity links or inter-Connectivity links can increase the robusts of the system, while the interdependency links decrease its robustness. Expand
From a single network to a network of networks
Network science has attracted much attention in recent years due to its interdisciplinary applications. We witnessed the revolution of network science in 1998 and 1999 started with small-world andExpand
Percolation of partially interdependent networks under targeted attack.
TLDR
The percolation of partially interdependent networks under targeted attack is analyzed and a general technique is applied that maps a targeted-attack problem in inter dependent networks to a random- attack problem in a transformed pair of interdependent Networks. Expand
Percolation and cascade dynamics of spatial networks with partial dependency
TLDR
Measurements of cascade dynamics which differentiate between these phase transitions and elucidate their mechanisms are presented and shed new light on the specific dynamics of dependencydriven cascading failures. Expand
Percolation of partially interdependent scale-free networks.
TLDR
The known theoretical p(c)=0 for a single network with λ≤3 is expected to be valid also for strictly partial interdependent networks. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 72 REFERENCES
Catastrophic cascade of failures in interdependent networks
TLDR
This work develops a framework for understanding the robustness of interacting networks subject to cascading failures and presents exact analytical solutions for the critical fraction of nodes that, on removal, will lead to a failure cascade and to a complete fragmentation of two interdependent networks. Expand
Resilience of the internet to random breakdowns
TLDR
This work shows analytically and numerically that for alpha</=3 the transition never takes place, unless the network is finite, and finds that the physical structure of the Internet is impressively robust, with p(c)>0.99. Expand
Interdependent networks: reducing the coupling strength leads to a change from a first to second order percolation transition.
TLDR
It is shown both analytically and numerically that reducing the coupling between the networks leads to a change from a first order percolation phase transition to a second orderpercolation transition at a critical point. Expand
Critical effect of dependency groups on the function of networks
TLDR
It is shown that a synergy exists between the failure of connectivity and dependency links that leads to an iterative process of cascading failures that has a devastating effect on the network stability. Expand
Network robustness and fragility: percolation on random graphs.
TLDR
This paper studies percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolators, bond percolations, and models in which occupation probabilities depend on vertex degree. Expand
Self-similarity of complex networks
TLDR
A power-law relation is identified between the number of boxes needed to cover the network and the size of the box, defining a finite self-similar exponent to explain the scale-free nature of complex networks and suggest a common self-organization dynamics. Expand
Complex Networks: Structure, Robustness and Function
TLDR
This chapter discusses random network models, which are based on the Erdos-Renyi models, and their application in the context of complex networks, where distances in scale-free networks are small and distances in complex networks are large. Expand
Statistical mechanics of complex networks
TLDR
A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network. Expand
Networks: An Introduction
TLDR
This book brings together for the first time the most important breakthroughs in each of these fields and presents them in a coherent fashion, highlighting the strong interconnections between work in different areas. Expand
Structure of shells in complex networks.
TLDR
A network correlation function c(rl) identical with rl/phi(rl-1) to characterize the correlations in the network is introduced, where rl is the empirical value and phi(rl)-1 is the theoretical prediction, which indicates perfect agreement between empirical results and theory. Expand
...
1
2
3
4
5
...