Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Albert, R., Jeong, H., Barabasi, A.: Error and attack tolerance of complex networks. Nature 406, 378–382 (2000)
Alvarez-Hamelin, I., Dall’Asta, L., Barrat, A., Vespignani, A.: k-core decomposition: a tool for the visualization of large scale networks. Adv. Neur. In. 18(16) (2005)
Buesser, P., Daolio, F., Tomassini, M.: Optimizing the robustness of scale-free networks with simulated annealing. In: Dobnikar, A., Lotrič, U., Šter, B. (eds.) Adaptive and Natural Computing Algorithms, vol. 6594, pp. 167–176. Springer, Berlin (2011)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M. P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Król, D.: Propagation phenomenon in complex networks: theory and practice. New Gener. Comput. 32(3–4), 187–192 (2014)
Latora, V., Marchiori, M.: Efficient Behavior of small-world networks. Phys. Rev. Lett. 87, 198701 (2001)
Newman, M.E.J.: Assortative mixing in networks. Phys. Rev. Lett. 89, 208701 (2002)
Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)
Schneider, C.M., Moreira, A.A., Andrade, J.S., Havlin, S., Herrmann, H.J.: Mitigation of malicious attacks on networks. Proc. Nat. Acad. Sci. USA 108, 3838–3841 (2011)
Wu, Z.X., Holme, P.: Onion structure and network robustness. Phys. Rev. E. 84, 026106 (2011)
Acknowledgments
This work was supported by the Swiss National Science Foundation under contract 200021 126853, the CNPq, Conselho Nacional de Desenvolvimento Científico e Tecnológico, Brasil, the European Research Council under grant FP7-319968-flowCSS, and ETH Zurich Risk Center.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Louzada, V.H.P., Daolio, F., Herrmann, H.J., Tomassini, M. (2015). Generating Robust and Efficient Networks Under Targeted Attacks. In: Król, D., Fay, D., Gabryś, B. (eds) Propagation Phenomena in Real World Networks. Intelligent Systems Reference Library, vol 85. Springer, Cham. https://doi.org/10.1007/978-3-319-15916-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-15916-4_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15915-7
Online ISBN: 978-3-319-15916-4
eBook Packages: EngineeringEngineering (R0)