arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1106.1631cond-mat.stat-mechcs.SIphysics.soc-ph
收藏

连通性和依赖性对网络逾渗的综合影响

The combined effect of connectivity and dependency links on percolation of networks

Amir Bashan, Shlomo Havlin

摘要:

逾渗理论在统计物理学和数学中得到了广泛的研究,并在各个领域得到了应用。然而,研究的重点是只有一种类型的链接,连接链接的系统。我们回顾了最近开发的数学框架,用于分析具有两种类型的链接,连接和依赖链接的网络的现实场景的渗流特性。这种形式主义被应用到研究Erd $\ddot{o}$ s-R $\acute{e}$ nyi(ER)网络,也包括依赖链接。对于由大小为$s$的依赖簇组成的具有平均度$k$的ER网络,属于巨型分量的节点的比例$P_\infty$由$ P_\infty=p^{s-1}[1-\exp{(-kpP_\infty)}]^s $给出,其中$1-p$是随机删除节点的初始比例。在这里,我们应用的形式主义的随机正则(RR)网络的研究,并找到一个公式的巨型组件在渗流过程中:$P_\infty=p^{s-1}(1-r^k)^s$其中$r$是解决方案的$r=p^s(r^{k-1}-1)(1-r^k)+1$。对于$s=1$,这些一般结果分别与没有依赖性链接的ER和RR网络中的渗流的已知方程相一致。与$s=1$的渗滤转变为二级相反,对于$s>1$,它为一级。比较ER和RR网络的逾渗行为,我们发现它们的弹性有显着差异。我们表明,分析和数值,在ER网络连接度低或大的依赖集群,删除即使是有限数量(零分数)的网络节点将触发一系列的故障,碎片整个网络。这个结果与RR网络相反,在RR网络中,这种级联和完全分裂只能通过移除网络中的有限部分节点来触发。

英文摘要:

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$\ddot{o}$s-R$\acute{e}$nyi (ER) networks that include also dependency links. For an ER network with average degree $k$ that is composed of dependency clusters of size $s$, the fraction of nodes that belong to the giant component, $P_\infty$, is given by $ P_\infty=p^{s-1}[1-\exp{(-kpP_\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_\infty=p^{s-1}(1-r^k)^s$ where $r$ is the solution of $r=p^s(r^{k-1}-1)(1-r^k)+1$. 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 network nodes will trigger a cascade of failures that fragments the whole network. 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑