title: L-hop percolation on networks with arbitrary degree distributions and its applications.
abstract: Site percolation has been used to help understand analytically the robustness of complex networks in the presence of random node deletion (or failure). In this paper we move a further step beyond random node deletion by considering that a node can be deleted because it is chosen or because it is within some L-hop distance of a chosen node. Using the generating functions approach, we present analytic results on the percolation threshold as well as the mean size, and size distribution, of nongiant components of complex networks under such operations. The introduction of parameter L is both conceptually interesting because it accommodates a sort of nonindependent node deletion, which is often difficult to tackle analytically, and practically interesting because it offers useful insights for cybersecurity (such as botnet defense).
authors: Institute for Cyber Security, University of Texas at San Antonio, Texas 78249, USA.
authors: Yilun
authors: Y
authors: Shang
authors: Weiliang
authors: W
authors: Luo
authors: Shouhuai
authors: S
authors: Xu