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

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 robust against random failures. Furthermore, as the size of the network increases, its shortest path becomes asymptotically invariant and the density of links goes to zero, making it ultra-small world and highly sparse, respectively. The first property is ideal for communication and navigation purposes, while the second is interesting economically. Finally, we show that some simple changes on the original network formulation can lead to an improved topology against malicious attacks.

[1]  José S. Andrade,et al.  Erratum: Apollonian Networks: Simultaneously Scale-Free, Small World, Euclidean, Space Filling, and with Matching Graphs [Phys. Rev. Lett. 94 , 018702 (2005)] , 2009 .

[2]  Sergey N. Dorogovtsev,et al.  Critical phenomena in complex networks , 2007, ArXiv.

[3]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[4]  M Leone,et al.  Trading interactions for topology in scale-free networks. , 2005, Physical review letters.

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

[6]  Shlomo Havlin,et al.  Anomalous transport in scale-free networks. , 2005, Physical review letters.

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

[8]  Marco Tomassini,et al.  Smart Rewiring for Network Robustness , 2013, J. Complex Networks.

[9]  R. Pastor-Satorras,et al.  Routes to thermodynamic limit on scale-free networks. , 2007, Physical review letters.

[10]  M. Newman,et al.  Scaling and percolation in the small-world network model. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[11]  Muhittin Mungan,et al.  Comment on "Apollonian networks: simultaneously scale-free, small world, euclidean, space filling, and with matching graphs". , 2011, Physical review letters.

[12]  André A Moreira,et al.  Biased percolation on scale-free networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Reuven Cohen,et al.  Anomalous biased diffusion in networks. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  H. Stanley,et al.  Robustness of network of networks under targeted attack. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  J. S. Andrade,et al.  Apollonian networks: simultaneously scale-free, small world, euclidean, space filling, and with matching graphs. , 2004, Physical review letters.

[16]  M. Newman.  Communities, modules and large-scale structure in networks , 2011, Nature Physics.

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

[18]  Albert-László Barabási,et al.  Scale-Free Networks: A Decade and Beyond , 2009, Science.

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

[20]  M. Newman,et al.  Fast Monte Carlo algorithm for site or bond percolation. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Romualdo Pastor-Satorras,et al.  Quasistationary simulations of the contact process on quenched networks. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Lin Gao,et al.  Maintain the structural controllability under malicious attacks on directed networks , 2013 .

[23]  Reuven Cohen,et al.  Efficient immunization strategies for computer networks and populations. , 2002, Physical review letters.

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

[25]  Stefan Bornholdt,et al.  Evolution of robust network topologies: Emergence of central backbones , 2012, Physical review letters.

[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]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

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

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

[30]  Hans J. Herrmann,et al.  Inverse targeting —An effective immunization strategy , 2011, ArXiv.

[31]  Hans J. Herrmann,et al.  Onion-like network topology enhances robustness against malicious attacks , 2011 .

[32]  Harry Eugene Stanley,et al.  Robustness of onion-like correlated networks against targeted attacks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  Li-Na Wang,et al.  Correct degree distribution of apollonian networks , 2010 .

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

[35]  H. Herrmann,et al.  How to Make a Fragile Network Robust and Vice Versa , 2009, Physical review letters.

[36]  Shilpa Chakravartula,et al.  Complex Networks: Structure and Dynamics , 2014 .

[37]  Dirk Helbing,et al.  Globally networked risks and how to respond , 2013, Nature.

[38]  L. D. Valdez,et al.  Effect of degree correlations above the first shell on the percolation transition , 2011, 1109.0560.

[39]  Juan G. Restrepo,et al.  A network-specific approach to percolation in complex networks with bidirectional links , 2011, 1108.4735.