Breakdown of the internet under intentional attack
Breakdown of the internet under intentional attack
复制标题
DOI：
10.1103/physrevlett.86.3682
复制
发表时间：
2001-04-16
影响因子：
8.6
通讯作者：
Havlin, S
中科院分区：
文献类型：
--
作者：
Cohen, R;Erez, K;Havlin, S
我们研究随机网络对故意攻击的容忍度，其中连接最多的站点的一小部分 p 被删除。我们专注于无标度网络，其连通性分布 P(k) 类似于 k(-alpha)，并使用渗流理论以分析和数值方式研究网络分解所需的临界分数 p(c)，以及最大连通簇的大小。我们发现，即使 alpha 小于或等于 3 的网络（已知对随机删除站点具有弹性）也对故意攻击敏感。我们还认为，在接近临界点时，跨越（最大）簇中站点之间的平均距离与其质量 M 成比例，作为 rootM 而不是 log(k) M，正如远离临界点的随机网络所预期的那样。
We study the tolerance of random networks to intentional attack, whereby a fraction p of the most connected sites is removed. We focus on scale-free networks, having connectivity distribution P(k) similar to k(-alpha), and use percolation theory to study analytically and numerically the critical fraction p(c) needed for the disintegration of the network, as well as the size of the largest connected cluster We find that even networks with alpha less than or equal to 3, known to be resilient to random removal of sites, are sensitive to intentional attack. We also argue that, near criticality, the average distance between sites in the spanning (largest) cluster scales with its mass, M, as rootM rather than as log(k) M, as expected for random networks away from criticality.