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 networkchosen at random (chosen accordingly to degree or load). We consider and compare the results for two di/erent networktopologies: the Erd1os–R2enyi random graph and the Barab2asi–Albert scale-free network. We also discuss brie5y 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.
|Titolo:||Error and attack tolerance of complex networks|
|Data di pubblicazione:||2004|
|Appare nelle tipologie:||1.1 Articolo in rivista|