Mandala Networks: ultra-robust, ultra-small-world and highly sparse graphs

Abstract

The increasing demands in security and reliability of infrastructures call for the optimal design of their embedded complex networks topologies. The following question then arises: what is the optimal layout to fulfill best all the demands? Here we present a general solution for this problem with scale-free networks, like the Internet and airline networks. Precisely, we disclose a way to systematically construct networks which are 100$\%$ robust against random failures as well as to malicious attacks. Furthermore, as the sizes of these networks increase, their shortest paths become asymptotically invariant and densities of links go to zero, making them ultra-small worlds and highly sparse, respectively. The first property is ideal for communication and navigation purposes, while the second is interesting economically.

arXiv comment8 pages, 5 figures

References in corpus (21)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• Resilience of the Internet to random breakdowns
• Critical phenomena in complex networks
• Breakdown of the Internet under intentional attack
• Efficient Immunization Strategies for Computer Networks and Populations
• A fast Monte Carlo algorithm for site or bond percolation
• Enhancing network robustness for malicious attacks
• Optimization of Network Robustness to Waves of Targeted and Random Attack
• How to make a fragile network robust and vice versa
• Robustness of onion-like correlated networks against targeted attacks
• Onion structure and network robustness
• Anomalous Transport in Complex Networks
• Evolution of robust network topologies: Emergence of central backbones
• Routes to thermodynamic limit on scale-free networks
• Quasi-stationary simulations of the contact process on quenched networks
• Biased Percolation on Scale-free Networks
• Trading interactions for topology in scale-free networks
• Anomalous biased diffusion in networks
• Effect of degree correlations above the first shell on the percolation transition
• A network-specific approach to percolation in networks with bidirectional links