arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cond-mat/0404331cond-mat.othercond-mat.stat-mech
收藏

复杂网络鲁棒性的优化

Optimization of Robustness of Complex Networks

G. Paul, T. Tanizawa, S. Havlin, H. E. Stanley

摘要:

具有给定度分布的网络可能对一种类型的故障或攻击非常有弹性,但对另一种类型的故障或攻击则没有弹性。这项工作的目标是确定网络设计准则,最大限度地提高网络的鲁棒性,以随机故障和故意攻击,同时保持网络的成本(我们采取的是每个节点的平均链接数)恒定。我们找到了最佳参数:(i)无标度网络的度分布与一个单一的幂律制度,(ii)网络的度分布与两个幂律制度,和(iii)网络描述的度分布包含两个峰值。在这些不同的分布中,我们发现最优的网络设计是这样的:除了一个节点之外,所有节点都具有相同的度$k_1$(接近每个节点的平均链接数),并且一个节点具有非常大的度$k_2 \sim N^{2/3}$,其中$N$是网络中的节点数。

英文摘要:

Networks with a given degree distribution may be very resilient to one type of failure or attack but not to another. The goal of this work is to determine network design guidelines which maximize the robustness of networks to both random failure and intentional attack while keeping the cost of the network (which we take to be the average number of links per node) constant. We find optimal parameters for: (i) scale free networks having degree distributions with a single power-law regime, (ii) networks having degree distributions with two power-law regimes, and (iii) networks described by degree distributions containing two peaks. Of these various kinds of distributions we find that the optimal network design is one in which all but one of the nodes have the same degree, $k_1$ (close to the average number of links per node), and one node is of very large degree, $k_2 \sim N^{2/3}$, where $N$ is the number of nodes in the network.

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

↑