We study the tolerance of random networks to intentional attack, whereby a fraction of the most connected sites is removed. We focus on scale-free networks, having connectivity distribution , and use percolation theory to study analytically and numerically the critical fraction needed for the disintegration of the network, as well as the size of the largest connected cluster. We find that even networks with , 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, , as , rather than as , as expected for random networks away from criticality.
- Received 17 October 2000
©2001 American Physical Society