Percolation of partially interdependent scale-free networks
نویسندگان
چکیده
منابع مشابه
Percolation of partially interdependent scale-free networks.
We study the percolation behavior of two interdependent scale-free (SF) networks under random failure of 1-p 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 q reduces from 1 (fully coupled) to 0 (no coupling), there exist two critical coupling strengths q(1) and q(2), which ...
متن کاملPercolation of partially interdependent networks under targeted attack.
We study a system composed of two partially interdependent networks; when nodes in one network fail, they cause dependent nodes in the other network to also fail. In this paper, the percolation of partially interdependent networks under targeted attack is analyzed. We apply a general technique that maps a targeted-attack problem in interdependent networks to a random-attack problem in a transfo...
متن کاملGroup percolation in interdependent networks
Zexun Wang, 2, ∗ Dong Zhou, ∗ and Yanqing Hu 4, † School of Data and Computer Science, Sun Yat-sen University, Guangzhou 510006, China Big Data Research Center,University of Electronic Science and Technology of China, Chengdu 611731, China Simula Research Laboratory, 1325 Lysaker, Norway Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 611731, China (D...
متن کاملPercolation in real interdependent networks
The function of a real network depends not only on the reliability of its own components, but is a ected also by the simultaneous operation of other real networks coupled with it. Whereas theoretical methods of direct applicability to real isolated networks exist, the frameworks developed so far in percolation theory for interdependent network layers are of little help in practical contexts, as...
متن کاملBiased percolation on scale-free networks.
Biased (degree-dependent) percolation was recently shown to provide strategies for turning robust networks fragile and vice versa. Here, we present more detailed results for biased edge percolation on scale-free networks. We assume a network in which the probability for an edge between nodes i and j to be retained is proportional to (k(i)k(j)(-alpha) with k(i) and k(j) the degrees of the nodes....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2013
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.87.052812