ATTACK VULNERABILITY OF COMPLEX NETWORKS BASED ON LOCAL INFORMATION

We introduce a novel model for attack vulnerability of complex networks with a tunable attack information parameter. Based on the model, we study the attack vulnerability of complex networks based on local information. We employ the generating function formalism to derive the exact value of the critical removal fraction of nodes for the disintegration of networks and the size of the giant component based on local information. We show that hiding just a small fraction of nodes can prevent the breakdown of a network and that it is a cost-efficient strategy for enhancing the robustness of complex networks to hide the information of networks.

[1]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[4]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[5]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 2000, Physical review letters.

[6]  Y. Moreno,et al.  Resilience to damage of graphs with degree correlations. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[8]  H. Stanley,et al.  Resilience of complex networks to random breakdown. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

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

[11]  Petter Holme,et al.  Efficient local strategies for vaccination and network attack , 2004, q-bio/0403021.

[12]  Ying-Cheng Lai,et al.  Complex networks: Dynamics and security , 2005 .

[13]  Jian-Guo Liu,et al.  Optimization of Robustness of Scale-Free Network to Random and Targeted Attacks , 2005 .

[14]  Réka Albert,et al.  Structural vulnerability of the North American power grid. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[16]  Béla Bollobás,et al.  Robustness and Vulnerability of Scale-Free Random Graphs , 2004, Internet Math..

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

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

[19]  Alessandro Vespignani,et al.  Large-scale topological and dynamical properties of the Internet. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[21]  Asim S. Siddiqui,et al.  Preferential network perturbation , 2006 .

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

[23]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

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