网络的网络的鲁棒性
Robustness of a Network of Networks
摘要:
几乎所有的网络研究都集中在一个不相互作用并依赖于其他网络的单一网络的属性上。实际上,许多真实世界的网络与其他网络交互。在这里,我们开发了一个分析框架,研究相互作用的网络和$n$相互依赖的网络提出了一个确切的渗流定律。特别地,我们发现对于每个平均度为$k$的$n$ Erdens-Rényi网络,巨分支$P_{\infty}$由$P_{\infty}=p[1-\exp(-kP_{\infty})]^n$给出,其中$1-p$是删除节点的初始分数。我们对$n=1$的一般结果与已知的单个网络的Erdens-Rényi二阶相变一致。对于任何$n \geq 2$级联故障发生和过渡成为一级渗流过渡。$P_{\infty}$的新定律表明,在物理学和数学中被广泛研究的渗流理论是相互依赖网络的更普遍的一般和不同的渗流定律的极限情况($n=1$)。
英文摘要:
Almost all network research has been focused on the properties of a single network that does not interact and depends on other networks. In reality, many real-world networks interact with other networks. Here we develop an analytical framework for studying interacting networks and present an exact percolation law for a network of $n$ interdependent networks. In particular, we find that for $n$ Erdős-Rényi networks each of average degree $k$, the giant component, $P_{\infty}$, is given by $P_{\infty}=p[1-\exp(-kP_{\infty})]^n$ where $1-p$ is the initial fraction of removed nodes. Our general result coincides for $n=1$ with the known Erdős-Rényi second-order phase transition for a single network. For any $n \geq 2$ cascading failures occur and the transition becomes a first-order percolation transition. The new law for $P_{\infty}$ shows that percolation theory that is extensively studied in physics and mathematics is a limiting case ($n=1$) of a more general general and different percolation law for interdependent networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。