arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.4626physics.soc-ph
收藏

空间嵌入网络的鲁棒性

Robustness of a Network Formed of Spatially Embedded Networks

Louis M. Shekhtman, Yehiel Berezin, Michael M. Danziger, Shlomo Havlin

摘要:

我们提出了分析和数值结果的相互依赖的空间嵌入网络形成的网络中的渗流。我们展示了一个树状网络和一个随机规则网络的结果,每个网络都有$(i)$无约束的相互依赖的链接和$(ii)$相互依赖的链接限制到一个最大长度,$r$。分析结果给出了每个网络的网络与无约束的依赖关系的链接,并与模拟比较。对于两个空间嵌入网络的情况下,发现只有$r>r_c\approx8$的系统进行一级相变。我们发现,对于树状网络的网络$r_c$显着减少$n$增加,并迅速达到其极限值,$r=1$。对于依赖关系形成循环的情况,例如在随机规则网络中,我们通过分析和模拟证实,存在一定比例的依赖节点$q_{max}$,超过该比例,即使删除单个节点,整个网络结构也会崩溃。这个$q_{max}$随着网络的随机规则网络的度$m$而迅速减小。我们的研究结果表明,耦合空间网络的极端敏感性,并强调这些网络突然崩溃的敏感性。这里导出的理论可以用来找到任何网络的网络的鲁棒性,其中单个网络的渗透轮廓是已知的。

英文摘要:

We present analytic and numeric results for percolation in a network formed of interdependent spatially embedded networks. We show results for a treelike and a random regular network of networks each with $(i)$ unconstrained interdependent links and $(ii)$ interdependent links restricted to a maximum length, $r$. Analytic results are given for each network of networks with unconstrained dependency links and compared with simulations. For the case of two spatially embedded networks it was found that only for $r>r_c\approx8$ does the system undergo a first order phase transition. We find that for treelike networks of networks $r_c$ significantly decreases as $n$ increases and rapidly reaches its limiting value, $r=1$. For cases where the dependencies form loops, such as in random regular networks, we show analytically and confirm through simulations, that there is a certain fraction of dependent nodes, $q_{max}$, above which the entire network structure collapses even if a single node is removed. This $q_{max}$ decreases quickly with $m$, the degree of the random regular network of networks. Our results show the extreme sensitivity of coupled spatial networks and emphasize the susceptibility of these networks to sudden collapse. The theory derived here can be used to find the robustness of any network of networks where the profile of percolation of a single network is known.

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

↑