Optimization of robustness and connectivity in complex networks.
Optimization of robustness and connectivity in complex networks.
复制标题
DOI：
10.1103/physrevlett.90.068701
复制
发表时间：
2003-02
影响因子：
8.6
通讯作者：
Ben Shargel;Hiroki Sayama;I. Epstein;Y. Bar-Yam
中科院分区：
文献类型：
--
作者：
Ben Shargel;Hiroki Sayama;I. Epstein;Y. Bar-Yam
无标度网络依赖于相对少量的高度连接的节点来实现高度的互连性和对随机故障的鲁棒性，但遭受定向攻击的高度敏感性。在本文中，我们描述了一个参数化的网络族，并分析了它们的连通性和敏感性，确定了一个网络，具有更接近于无标度网络的互连性，攻击的鲁棒性接近于指数网络，并且比这些网络中的任何一个都更好地抵抗故障。
Scale-free networks rely on a relatively small number of highly connected nodes to achieve a high degree of interconnectivity and robustness to random failure, but suffer from a high sensitivity to directed attack. In this paper we describe a parameterized family of networks and analyze their connectivity and sensitivity, identifying a network that has an interconnectedness closer to that of a scale-free network, a robustness to attack closer to that of an exponential network, and a resistance to failure better than that of either of those networks.