Thumbnail
Access Restriction
Subscribed

Author Magnien, Clmence ♦ Latapy, Matthieu ♦ Guillaume, Jean-Loup
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2011
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Network resilience ♦ Network failures and attacks ♦ Node and link removals
Abstract It has appeared recently that the underlying degree distribution of networks may play a crucial role concerning their robustness. Previous work insisted on the fact that power-law degree distributions induce high resilience to random failures but high sensitivity to attack strategies, while Poisson degree distributions are quite sensitive in both cases. Then much work has been done to extend these results. We aim here at studying in depth these results, their origin, and limitations. We review in detail previous contributions in a unified framework, and identify the approximations on which these results rely. We then present new results aimed at clarifying some important aspects. We also provide extensive rigorous experiments which help evaluate the relevance of the analytic results. We reach the conclusion that, even if the basic results are clearly important, they are in practice much less striking than generally thought. The differences between random failures and attacks are not so huge and can be explained with simple facts. Likewise, the differences in the behaviors induced by power-law and Poisson distributions are not as striking as often claimed.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2011-04-01
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 43
Issue Number 3
Page Count 31
Starting Page 1
Ending Page 31


Open content in new tab

   Open content in new tab
Source: ACM Digital Library