Degree-based attacks and defense strategies in complex networks

Abstract

We study the stability of random scale-free networks to degree-dependent attacks. We present analytical and numerical results to compute the critical fraction $p_c$ of nodes that need to be removed for destroying the network under this attack for different attack parameters. We study the effect of different defense strategies, based on the addition of a constant number of links on network robustness. We test defense strategies based on adding links to either low degree, middegree or high degree nodes. We find using analytical results and simulations that the middegree nodes defense strategy leads to the largest improvement to the network robustness against degree-based attacks. We also test these defense strategies on an internet autonomous systems map and obtain similar results. DOI: http://dx.doi.org/10.1103/PhysRevE.86.066114 ©2012 American Physical Society