Error and attack tolerance of complex networks

Paolo Crucitti, Vito Latora, Massimo Marchiori and Andrea Rapisarda

Physica A: Statistical Mechanics and its Applications, 2004, vol. 340, issue 1, 388-394

Abstract: Communication/transportation systems are often subjected to failures and attacks. Here we represent such systems as networks and we study their ability to resist failures (attacks) simulated as the breakdown of a group of nodes of the network chosen at random (chosen accordingly to degree or load). We consider and compare the results for two different network topologies: the Erdös–Rényi random graph and the Barabási–Albert scale-free network. We also discuss briefly a dynamical model recently proposed to take into account the dynamical redistribution of loads after the initial damage of a single node of the network.

Keywords: Structure of complex networks; Scale-free networks (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (59)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037843710400439X
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:340:y:2004:i:1:p:388-394

DOI: 10.1016/j.physa.2004.04.031

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 ().