Tolerance of scale-free networks against attack-induced cascades

Liang Zhao, Kwangho Park, Ying-Cheng Lai, N Ye

Research output: Contribution to journalArticle

103 Citations (Scopus)

Abstract

Scale-free networks can be disintegrated by attack on a single or a very few nodes through the process of cascading failures. By utilizing a prototype cascading model, we previously determined the critical value of the capacity parameter below which the network can become disintegrated due to attack on a single node. A fundamental question in network security, which has not been addressed previously but may be more important and of wider interest, is how to design networks of finite capacity that are safe against cascading breakdown. Here we derive an upper bound for the capacity parameter, above which the network is immune to cascading breakdown. Our theory also yields estimates for the maximally achievable network integrity via controlled removal of a small set of low-degree nodes. The theoretical results are confirmed numerically.

Original languageEnglish
Article number025104
Pages (from-to)-
Number of pages4
JournalPhysical Review. E, Statistical, Nonlinear and Soft Matter Physics
Volume72
Issue number2
DOIs
Publication statusPublished - Aug 2005

Keywords

  • internet

Cite this

Tolerance of scale-free networks against attack-induced cascades. / Zhao, Liang; Park, Kwangho; Lai, Ying-Cheng; Ye, N .

In: Physical Review. E, Statistical, Nonlinear and Soft Matter Physics, Vol. 72, No. 2, 025104, 08.2005, p. -.

Research output: Contribution to journalArticle

Zhao, Liang ; Park, Kwangho ; Lai, Ying-Cheng ; Ye, N . / Tolerance of scale-free networks against attack-induced cascades. In: Physical Review. E, Statistical, Nonlinear and Soft Matter Physics. 2005 ; Vol. 72, No. 2. pp. -.
@article{284d0a8e677b49feb85cce25554b8336,
title = "Tolerance of scale-free networks against attack-induced cascades",
abstract = "Scale-free networks can be disintegrated by attack on a single or a very few nodes through the process of cascading failures. By utilizing a prototype cascading model, we previously determined the critical value of the capacity parameter below which the network can become disintegrated due to attack on a single node. A fundamental question in network security, which has not been addressed previously but may be more important and of wider interest, is how to design networks of finite capacity that are safe against cascading breakdown. Here we derive an upper bound for the capacity parameter, above which the network is immune to cascading breakdown. Our theory also yields estimates for the maximally achievable network integrity via controlled removal of a small set of low-degree nodes. The theoretical results are confirmed numerically.",
keywords = "internet",
author = "Liang Zhao and Kwangho Park and Ying-Cheng Lai and N Ye",
year = "2005",
month = "8",
doi = "10.1103/PhysRevE.72.025104",
language = "English",
volume = "72",
pages = "--",
journal = "Physical Review. E, Statistical, Nonlinear and Soft Matter Physics",
issn = "1539-3755",
publisher = "AMER PHYSICAL SOC",
number = "2",

}

TY - JOUR

T1 - Tolerance of scale-free networks against attack-induced cascades

AU - Zhao, Liang

AU - Park, Kwangho

AU - Lai, Ying-Cheng

AU - Ye, N

PY - 2005/8

Y1 - 2005/8

N2 - Scale-free networks can be disintegrated by attack on a single or a very few nodes through the process of cascading failures. By utilizing a prototype cascading model, we previously determined the critical value of the capacity parameter below which the network can become disintegrated due to attack on a single node. A fundamental question in network security, which has not been addressed previously but may be more important and of wider interest, is how to design networks of finite capacity that are safe against cascading breakdown. Here we derive an upper bound for the capacity parameter, above which the network is immune to cascading breakdown. Our theory also yields estimates for the maximally achievable network integrity via controlled removal of a small set of low-degree nodes. The theoretical results are confirmed numerically.

AB - Scale-free networks can be disintegrated by attack on a single or a very few nodes through the process of cascading failures. By utilizing a prototype cascading model, we previously determined the critical value of the capacity parameter below which the network can become disintegrated due to attack on a single node. A fundamental question in network security, which has not been addressed previously but may be more important and of wider interest, is how to design networks of finite capacity that are safe against cascading breakdown. Here we derive an upper bound for the capacity parameter, above which the network is immune to cascading breakdown. Our theory also yields estimates for the maximally achievable network integrity via controlled removal of a small set of low-degree nodes. The theoretical results are confirmed numerically.

KW - internet

U2 - 10.1103/PhysRevE.72.025104

DO - 10.1103/PhysRevE.72.025104

M3 - Article

VL - 72

SP - -

JO - Physical Review. E, Statistical, Nonlinear and Soft Matter Physics

JF - Physical Review. E, Statistical, Nonlinear and Soft Matter Physics

SN - 1539-3755

IS - 2

M1 - 025104

ER -