复杂网络的旁路重布线与鲁棒性
Bypass rewiring and robustness of complex networks
摘要:
提出了旁路重布线的概念,并对随机旁路重布线进行了分析和数值模拟研究。我们的研究结果表明,旁路重新布线使网络鲁棒性对删除节点,包括随机故障和攻击。特别地,随机旁路重布线连接了偶数度无限网络上除被移除节点之外的所有节点,并使任意占用概率的渗流阈值为0。在我们的例子中,偶数度网络比具有随机旁路重新布线的原始网络更健壮,而原始网络比没有随机旁路的偶数度网络更健壮。我们提出了一个贪婪的旁路重布线算法,保证在每一步的最大组件的最大尺寸,假设哪个节点将被删除下一个是未知的。仿真结果表明,贪婪旁路重布线算法比随机旁路重布线算法更能提高互联网自治系统在攻击下的鲁棒性。
英文摘要:
A concept of bypass rewiring is introduced and random bypass rewiring is analytically and numerically investigated with simulations. Our results show that bypass rewiring makes networks robust against removal of nodes including random failures and attacks. In particular, random bypass rewiring connects all nodes except the removed nodes on an even degree infinite network and makes the percolation threshold 0 for arbitrary occupation probabilities. In our example, the even degree network is more robust than the original network with random bypass rewiring while the original network is more robust than the even degree networks without random bypass. We propose a greedy bypass rewiring algorithm which guarantees the maximum size of the largest component at each step, assuming which node will be removed next is unknown. The simulation result shows that the greedy bypass rewiring algorithm improves the robustness of the autonomous system of the Internet under attacks more than random bypass rewiring.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。