When half the nodes of a random graph the size of most real-world networks are removed, the network is destroyed. But when the same procedure is carried out against a scale-free model of a similar size, 'the giant connected component resists even after removing more than 80 per cent of the nodes, and the average distance within it [between nodes] is practically the same as at the beginning