Generating Robust and Efficient Networks Under Targeted Attacks

Much of our commerce and travel depends on the efficient operation of large scale networks. Some of those, such as electric power grids, transportation systems, communication networks, and others, must maintain their efficiency even after several failures, or malicious attacks. We outline a procedure that modifies any given network to enhance its robustness, defined as the size of its largest connected component after a succession of attacks, whilst keeping a high efficiency, described in terms of the shortest paths among nodes. We also show that this generated set of networks is very similar to networks optimized for robustness in several aspects such as high assortativity and the presence of an onion-like structure.

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

[2]  Alessandro Vespignani,et al.  K-core Decomposition: a Tool for the Visualization of Large Scale Networks , 2005, ArXiv.

[3]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[4]  Alessandro Vespignani,et al.  Large scale networks fingerprinting and visualization using the k-core decomposition , 2005, NIPS.

[5]  Hans J. Herrmann,et al.  Mitigation of malicious attacks on networks , 2011, Proceedings of the National Academy of Sciences.

[6]  Marco Tomassini,et al.  Optimizing the Robustness of Scale-Free Networks with Simulated Annealing , 2011, ICANNGA.

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

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

[9]  R. Rosenfeld Nature , 2009, Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery.

[10]  M S Kearns,et al.  ADV NEUR IN , 1999, NIPS 1999.

[11]  J. M. Oshorn Proc. Nat. Acad. Sei , 1978 .

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

[13]  Marco Tomassini,et al.  Adaptive and Natural Computing Algorithms , 2013, Lecture Notes in Computer Science.

[14]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[15]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[16]  Petter Holme,et al.  Onion structure and network robustness , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.