2012/07/31 by Vitor H. P. Louzada, Fabio Daolio, Hans J. Herrmann +1 · 25 citations
Computer Science · Engineering · Physics and Astronomy · #Advanced Optical Network Technologies #Assortativity #Complexity and Algorithms in Graphs #Component (thermodynamics) #Network topology #Robustness (evolution) #Scale (ratio) #Set (abstract data type) #Software-Defined Networks and 5G #cs.SI #physics.soc-ph
paper · pdf · doi:10.1007/978-3-319-15916-4_9
published in Intelligent systems reference library, 215-224 (Springer Nature)
openalex publication_date 2015/01/01 · arxiv created 2015/03/24 · arxiv updated 2015/03/26 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
Much of our commerce and traveling depend 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.