• Access by Staats- und Universitaetsbibliothek Bremen

Breakdown of the Internet under Intentional Attack

Phys. Rev. Lett. 86, 3682 – Published 16 April 2001
Reuven Cohen, Keren Erez, Daniel ben-Avraham, and Shlomo Havlin

Abstract

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)kα, and use percolation theory to study analytically and numerically the critical fraction pc needed for the disintegration of the network, as well as the size of the largest connected cluster. We find that even networks with α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 M, rather than as logkM, as expected for random networks away from criticality.

DOI: http://dx.doi.org/10.1103/PhysRevLett.86.3682

  • Received 17 October 2000
  • Published in the issue dated 16 April 2001

© 2001 The American Physical Society

Authors & Affiliations

Reuven Cohen1,*, Keren Erez1, Daniel ben-Avraham2, and Shlomo Havlin1

  • 1Minerva Center and Department of Physics, Bar-Ilan University, Ramat-Gan, Israel
  • 2Department of Physics, Clarkson University, Potsdam, New York 13699-5820

  • *Email address: cohenr@shoshi.ph.biu.ac.il

Related

Click to Expand

References

Click to Expand

Authorization Required


×

Download & Share


PDF Export Citing Articles (327)
×

Images

1 of 0
    ×

    Log In

    Cancel
    ×

    Search


    Article Lookup
    Paste a citation or DOI

    Enter a citation
    ×
    1. Enter a citation to look up or terms to search.

      Ex: "PRL 112 068103", "Phys. Rev. Lett. 112, 068103", "10.1103/PhysRevLett.112.068103"

    Enter a citation to look up or terms to search.

    Ex: "PRL 112 068103", "Phys. Rev. Lett. 112, 068103", "10.1103/PhysRevLett.112.068103"

    Close×