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

双组分与网络的鲁棒性

Bicomponents and the robustness of networks to failure

M. E. J. Newman, Gourab Ghoshal

摘要:

在诸如通信网络之类的网络中的两个节点之间的鲁棒连接的常见定义是,应当存在连接它们的至少两个独立路径,使得网络中没有单个节点的故障导致它们断开。这个定义自然地引导我们去考虑双组分,即每个节点与其他节点之间都有这种鲁棒连接的子网络。在这里,我们研究双组分在真实和模型网络使用精确的分析技术和数值方法相结合。我们表明,标准的网络模型预测,在大多数网络中基本上没有小的双组分,但可能有一个巨大的双组分,其存在与存在的普通巨人组件,我们发现,真正的网络似乎大体上遵循这种模式,虽然有一些有趣的例外。我们研究的巨型双组分的网络中的节点失败的大小,使用一个专门开发的计算机算法的基础上的数据树,并发现在某些情况下,我们的网络是相当强大的失败,大双组分持续,直到几乎所有的顶点已被删除。

英文摘要:

A common definition of a robust connection between two nodes in a network such as a communication network is that there should be at least two independent paths connecting them, so that the failure of no single node in the network causes them to become disconnected. This definition leads us naturally to consider bicomponents, subnetworks in which every node has a robust connection of this kind to every other. Here we study bicomponents in both real and model networks using a combination of exact analytic techniques and numerical methods. We show that standard network models predict there to be essentially no small bicomponents in most networks, but there may be a giant bicomponent, whose presence coincides with the presence of the ordinary giant component, and we find that real networks seem by and large to follow this pattern, although there are some interesting exceptions. We study the size of the giant bicomponent as nodes in the network fail, using a specially developed computer algorithm based on data trees, and find in some cases that our networks are quite robust to failure, with large bicomponents persisting until almost all vertices have been removed.

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

↑