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

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

Physica A: Statistical Mechanics and its Applications, 2004, vol. 344, issue 3, 504-509

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 pc 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: Scale-free networks; Structural properties; Attacks (search for similar items in EconPapers)
Date: 2004
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437104007861
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:344:y:2004:i:3:p:504-509

DOI: 10.1016/j.physa.2004.06.021

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().