Valente André X C N, Sarkar Abhijit, Stone Howard A
Division of Engineering and Applied Sciences, Harvard University, Cambridge, Massachusetts 02138, USA.
Phys Rev Lett. 2004 Mar 19;92(11):118702. doi: 10.1103/PhysRevLett.92.118702.
A central issue in complex networks is tolerance of random failures and intentional attacks. Current literature emphasizes the dichotomy between networks with a power-law node connectivity distribution, which are robust to random failures but fragile to targeted attacks, versus networks with an exponentially decaying connectivity distribution, which are less tolerant to failures but more resilient to attacks. We prove analytically that the optimal network configuration under a classic measure of robustness is altogether different from both of the above: in all cases, failure and/or attack, there are no more than three distinct node connectivities in the optimal network.
复杂网络中的一个核心问题是对随机故障和蓄意攻击的耐受性。当前文献强调了具有幂律节点连通性分布的网络与具有指数衰减连通性分布的网络之间的二分法：前者对随机故障具有鲁棒性，但对定向攻击较为脆弱；后者对故障的耐受性较低，但对攻击更具弹性。我们通过分析证明，在一种经典的鲁棒性度量下，最优网络配置与上述两者完全不同：在所有故障和/或攻击的情况下，最优网络中不同的节点连通性不超过三种。
