Tolerance of scale-free networks: From friendly to intentional attack strategies

Lazaros K. Gallos; Panos Argyrakis; Armin Bunde; Reuven Cohen; Shlomo Havlin

doi:10.1016/j.physa.2004.06.021

Tolerance of scale-free networks: From friendly to intentional attack strategies

Lazaros K. Gallos, Panos Argyrakis, Armin Bunde, Reuven Cohen, Shlomo Havlin

Research output: Contribution to journal › Article › peer-review

29 Scopus citations

Abstract

We study the tolerance of a scale-free network (having a connectivity distribution P(k)∼k^-γ) under systematic variation of the attack strategy. In an attack, the probability that a given node is destroyed, depends on the number of its links k via W(k)∼k^α, where α varies from -∞ (most harmless attack) to +∞ (most harmful "intentional" attack). We show that the critical fraction p _c needed to disintegrate the network increases monotonically when α is decreased and study how at p_c the topology of the diluted network depends on the attack strategy.

Original language	English
Pages (from-to)	504-509
Number of pages	6
Journal	Physica A: Statistical Mechanics and its Applications
Volume	344
Issue number	3-4 SPEC. ISS.
DOIs	https://doi.org/10.1016/j.physa.2004.06.021
State	Published - 15 Dec 2004

Bibliographical note

Funding Information:
The author(s) disclosed receipt of the following financial support for the research, authorship and/or publication of this article: This study was supported by a grant from the Instituto Carlos III – Spanish Government (PI13/01782) and by a grant from Fundación Salud 2000 (2015). J.M.M. was supported by a Sara Borrell Fellowship from the Instituto Carlos III.

Funding

This work was supported by the DAAD, an IKYDA fellowship and by the Israel Science Foundation.

Funders	Funder number
Deutscher Akademischer Austauschdienst
Israel Science Foundation

Keywords

Attacks
Scale-free networks
Structural properties

Access to Document

10.1016/j.physa.2004.06.021

Cite this

@article{cbc60690c00c4900882b1bacc9922ff3,

title = "Tolerance of scale-free networks: From friendly to intentional attack strategies",

abstract = "We study the tolerance of a scale-free network (having a connectivity distribution P(k)∼k-γ) under systematic variation of the attack strategy. In an attack, the probability that a given node is destroyed, depends on the number of its links k via W(k)∼kα, where α varies from -∞ (most harmless attack) to +∞ (most harmful {"}intentional{"} attack). We show that the critical fraction p c needed to disintegrate the network increases monotonically when α is decreased and study how at pc the topology of the diluted network depends on the attack strategy.",

keywords = "Attacks, Scale-free networks, Structural properties",

author = "Gallos, {Lazaros K.} and Panos Argyrakis and Armin Bunde and Reuven Cohen and Shlomo Havlin",

note = "Funding Information: The author(s) disclosed receipt of the following financial support for the research, authorship and/or publication of this article: This study was supported by a grant from the Instituto Carlos III – Spanish Government (PI13/01782) and by a grant from Fundaci{\'o}n Salud 2000 (2015). J.M.M. was supported by a Sara Borrell Fellowship from the Instituto Carlos III.",

year = "2004",

month = dec,

day = "15",

doi = "10.1016/j.physa.2004.06.021",

language = "אנגלית",

volume = "344",

pages = "504--509",

journal = "Physica A: Statistical Mechanics and its Applications",

issn = "0378-4371",

publisher = "Elsevier B.V.",

number = "3-4 SPEC. ISS.",

}

TY - JOUR

T1 - Tolerance of scale-free networks

T2 - From friendly to intentional attack strategies

AU - Gallos, Lazaros K.

AU - Argyrakis, Panos

AU - Bunde, Armin

AU - Cohen, Reuven

AU - Havlin, Shlomo

N1 - Funding Information: The author(s) disclosed receipt of the following financial support for the research, authorship and/or publication of this article: This study was supported by a grant from the Instituto Carlos III – Spanish Government (PI13/01782) and by a grant from Fundación Salud 2000 (2015). J.M.M. was supported by a Sara Borrell Fellowship from the Instituto Carlos III.

PY - 2004/12/15

Y1 - 2004/12/15

N2 - We study the tolerance of a scale-free network (having a connectivity distribution P(k)∼k-γ) under systematic variation of the attack strategy. In an attack, the probability that a given node is destroyed, depends on the number of its links k via W(k)∼kα, where α varies from -∞ (most harmless attack) to +∞ (most harmful "intentional" attack). We show that the critical fraction p c needed to disintegrate the network increases monotonically when α is decreased and study how at pc the topology of the diluted network depends on the attack strategy.

AB - We study the tolerance of a scale-free network (having a connectivity distribution P(k)∼k-γ) under systematic variation of the attack strategy. In an attack, the probability that a given node is destroyed, depends on the number of its links k via W(k)∼kα, where α varies from -∞ (most harmless attack) to +∞ (most harmful "intentional" attack). We show that the critical fraction p c needed to disintegrate the network increases monotonically when α is decreased and study how at pc the topology of the diluted network depends on the attack strategy.

KW - Attacks

KW - Scale-free networks

KW - Structural properties

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

U2 - 10.1016/j.physa.2004.06.021

DO - 10.1016/j.physa.2004.06.021

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:6444241717

SN - 0378-4371

VL - 344

SP - 504

EP - 509

JO - Physica A: Statistical Mechanics and its Applications

JF - Physica A: Statistical Mechanics and its Applications

IS - 3-4 SPEC. ISS.

ER -

Tolerance of scale-free networks: From friendly to intentional attack strategies

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this