arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0710.2513cond-mat.dis-nn
收藏

无标度网络鲁棒性和负载容忍度的结构依赖性

Structural dependence of robustness and load tolerance in scale-free networks

Nobuhiko Oshida, Sigeo Ihara

摘要:

在以往的研究中,复杂网络的结构被广泛地描述为由偏好连接模型产生的无标度网络。然而,优先连接模型没有考虑到在真实网络中观察到的详细拓扑性质。在这里,我们提出了无标度网络的模型,它可以再现真实网络的拓扑可拓性。在度分布和网络规模相同的情况下,研究了随机攻击和各种故意攻击策略下节点相继被移除时网络结构的鲁棒性和脆弱性以及负载强度的动态变化.我们发现,dispertative网络是结构上强大的随机攻击和高度的负载容忍,而dispertative网络是最有抵抗力的故意攻击,但显着脆弱的随机攻击。

英文摘要:

The structure of complex networks in previous research has been widely described as scale-free networks generated by the preferential attachment model. However, the preferential attachment model does not take into account the detailed topological property observed in real networks. Here we propose the models of scale-free networks which can reproduce the topological assortativity of real networks. With an identical degree distribution and network size, we study the structural robustness and fragility as well as the dynamic change of load intensity when nodes are successively removed under random and various intentional attack strategies. We find that disassortative networks are structurally robust against random attacks and highly load-tolerant, while assortative networks are most resistant to intentional attacks yet significantly fragile against random attacks.

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

↑