Vulnerability of complex networks under intentional attack with incomplete information

We study the vulnerability of complex networks under intentional attack with incomplete information, which means that one can only preferentially attack the most important nodes among a local region of a network. The known random failure and the intentional attack are two extreme cases of our study. Using the generating function method, we derive the exact value of the critical removal fraction fc of nodes for the disintegration of networks and the size of the giant component. To validate our model and method, we perform simulations of intentional attack with incomplete information in scale-free networks. We show that the attack information has an important effect on the vulnerability of scale-free networks. We also demonstrate that hiding a fraction of the nodes information is a cost-efficient strategy for enhancing the robustness of complex networks.

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

[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]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

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

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

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

[8]  Lada A. Adamic,et al.  Power-Law Distribution of the World Wide Web , 2000, Science.

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

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

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

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

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

[14]  A. Barabasi,et al.  Halting viruses in scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

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

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

[19]  S. Havlin,et al.  Optimization of robustness of complex networks , 2004, cond-mat/0404331.

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

[21]  Abhijit Sarkar,et al.  Two-peak and three-peak optimal complex networks. , 2004, Physical review letters.

[22]  Reuven Cohen,et al.  Tolerance of scale-free networks: from friendly to intentional attack strategies , 2004 .

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

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

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

[26]  S. Havlin,et al.  Optimization of network robustness to waves of targeted and random attacks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[28]  L. Dall’Asta.  Inhomogeneous percolation models for spreading phenomena in random graphs , 2005, cond-mat/0509020.

[29]  Chonghui Guo,et al.  Entropy optimization of scale-free networks’ robustness to random failures , 2005, cond-mat/0506725.