New attack strategies for complex networks

The invulnerability of complex networks is an important issue in that the behavior of scale-free network differs from that of exponential network. According to the structural characteristics of the networks, we propose two new attack strategies named IDB (initial degree and betweenness) and RDB (recalculated degree and betweenness). The strategies are originated from ID (initial degree distribution) and RD (recalculated degree distribution) strategies in which attacks are based on initial structural information of a network. The probability of node removals depends on a new metric combining degree centrality and betweenness centrality. We evaluate the efficiency of the proposed strategies on one real-world network and three network models. Experimental results indicate that the proposed strategies are more efficient than the traditional ID and RD strategies. Specially, the WS small-world network behaves more sensitive to the proposed strategies. The attack efficiency of RDB strategy is improved by 20% to RD strategy, and IDB strategy is improved by 40% to ID strategy.

[1]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[2]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[3]  Stefano Allesina,et al.  Using food web dominator trees to catch secondary extinctions in action , 2009, Philosophical Transactions of the Royal Society B: Biological Sciences.

[4]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[5]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[6]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[7]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[8]  Michele Bellingeri,et al.  Threshold extinction in food webs , 2011, Theoretical Ecology.

[9]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.

[10]  Adilson E Motter.  Cascade control and defense in complex networks. , 2004, Physical review letters.

[11]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[12]  A C C Coolen,et al.  Network resilience against intelligent attacks constrained by the degree-dependent node removal cost , 2010, 1005.4283.

[13]  Reuven Cohen,et al.  Stability and topology of scale-free networks under attack and defense strategies. , 2005, Physical review letters.

[14]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  P. Oscar Boykin,et al.  Disaster management in power-law networks: Recovery from and protection against intentional attacks , 2007 .

[16]  Marcelo Kuperman,et al.  Effects of immunization in small-world epidemics , 2001, cond-mat/0109273.

[17]  T. Killingback,et al.  Attack Robustness and Centrality of Complex Networks , 2013, PloS one.

[18]  Peter Morters,et al.  Vulnerability of robust preferential attachment networks , 2013, 1306.3454.

[19]  Roberto da Silva,et al.  A simple combinatorial method to describe particle retention time in random media with applications in chromatography , 2012 .

[20]  V. Latora,et al.  Efficiency of scale-free networks: error and attack tolerance , 2002, cond-mat/0205601.

[21]  Michele Bellingeri,et al.  Efficiency of attack strategies on complex model and real-world networks , 2013, ArXiv.

[22]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[23]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[24]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[25]  Stefano Allesina,et al.  Googling Food Webs: Can an Eigenvector Measure Species' Importance for Coextinctions? , 2009, PLoS Comput. Biol..