Tolerance of scale-free networks against attack-induced cascades

Liang Zhao, Kwangho Park, Ying-Cheng Lai, Nong 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 (US)
Article number025104
JournalPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
Volume72
Issue number2
DOIs
StatePublished - Aug 2005

Fingerprint

Scale-free Networks
attack
Cascade
Tolerance
cascades
Attack
Breakdown
Vertex of a graph
Cascading Failure
Finite Capacity
Network Security
Network Design
Integrity
Critical value
breakdown
Prototype
Upper bound
Estimate
integrity
prototypes

ASJC Scopus subject areas

  • Physics and Astronomy(all)
  • Condensed Matter Physics
  • Statistical and Nonlinear Physics
  • Mathematical Physics

Cite this

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

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

Research output: Contribution to journalArticle

@article{35af1e71c3fe4cde91c619890ff05469,
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.",
author = "Liang Zhao and Kwangho Park and Ying-Cheng Lai and Nong Ye",
year = "2005",
month = "8",
doi = "10.1103/PhysRevE.72.025104",
language = "English (US)",
volume = "72",
journal = "Physical Review E - Statistical, Nonlinear, and Soft Matter Physics",
issn = "1539-3755",
publisher = "American Physical Society",
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, Nong

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.

UR - http://www.scopus.com/inward/record.url?scp=27244446465&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27244446465&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.72.025104

DO - 10.1103/PhysRevE.72.025104

M3 - Article

AN - SCOPUS:27244446465

VL - 72

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 -