The Combined Effect of Connectivity and Dependency Links on Percolation of Networks
| 详细信息 | 推荐本文 | |
- 作者：Amir Bashan (1) amir.bashan@gmail.com
Shlomo Havlin (1) havlin@ophir.ph.biu.ac.il - 关键词：Percolation – ; Networks – ; Cascade of failures – ; Dependency links
- 刊名：Journal of Statistical Physics
- 出版时间：November 2011
- 出版年：2011
- 期刊代码：19_00224715
- 类别：ph
- 卷：145
- 期：3
- 页码：686-695
- 数据来源：sp
摘要
Percolation theory is extensively studied in statistical physics and mathematics with applications in diverse fields. However, the research is focused on systems with only one type of links, connectivity links. We review a recently developed mathematical framework for analyzing percolation properties of realistic scenarios of networks having links of two types, connectivity and dependency links. This formalism was applied to study Erdős-R茅nyi (ER) networks that include also dependency links. For an ER network with average degree [`(k)]\bar{k} that is composed of dependency clusters of size s, the fraction of nodes that belong to the giant component, P ∞, is given by P楼=ps-1[1-exp(-[`(k)]pP楼) ]sP_{\infty}=p^{s-1}[1-\exp{(-\bar{k}pP_{\infty})} ]^{s} where 1−p is the initial fraction of randomly removed nodes. Here, we apply the formalism to the study of random-regular (RR) networks and find a formula for the size of the giant component in the percolation process: P ∞=p s−1(1−r k ) s where r is the solution of r=p s (r k−1−1)(1−r k )+1, and k is the degree of the nodes. These general results coincide, for s=1, with the known equations for percolation in ER and RR networks respectively without dependency links. In contrast to s=1, where the percolation transition is second order, for s>1 it is of first order. Comparing the percolation behavior of ER and RR networks we find a remarkable difference regarding their resilience. We show, analytically and numerically, that in ER networks with low connectivity degree or large dependency clusters, removal of even a finite number (zero fraction) of the infinite network nodes will trigger a cascade of failures that fragments the whole network. Specifically, for any given s there exists a critical degree value, [`(k)]min\bar{k}_{\min}, such that an ER network with [`(k)] 拢 [`(k)]min\bar{k}\leq \bar{k}_{\min} is unstable and collapse when removing even a single node. This result is in contrast to RR networks where such cascades and full fragmentation can be triggered only by removal of a finite fraction of nodes in the network.