Effect of edge removal on topological and functional robustness of complex networks

We study the robustness of several network models subject to edge removal. The robustness is measured by the statistics of network breakdowns, where a breakdown is defined as the destroying of the total connectedness of a network, rather than the disappearance of the giant component. We introduce a simple traffic dynamics as the function of a network topology, and the total connectedness can be destroyed in the sense of either the topology or the function. The overall effect of the topological breakdown and the functional breakdown, as well as the relative importance of the topological robustness and the functional robustness, are studied under two edge removal strategies.

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

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

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

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

[5]  Alexandre Arenas,et al.  Optimal network topologies for local search with congestion , 2002, Physical review letters.

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

[7]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.

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

[9]  Jean-Loup Guillaume,et al.  Comparison of Failures and Attacks on Random and Scale-Free Networks , 2004, OPODIS.

[10]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[11]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Reuven Cohen,et al.  Limited path percolation in complex networks. , 2007, Physical review letters.

[13]  Adilson E Motter,et al.  Cascade-based attacks on complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[15]  Guo-Jie Li,et al.  Enhancing the transmission efficiency by edge deletion in scale-free networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Alex Arenas,et al.  Effect of random failures on traffic in complex networks , 2007, SPIE International Symposium on Fluctuations and Noise.

[17]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[18]  M E J Newman,et al.  Component sizes in networks with arbitrary degree distributions. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  M. Barthelemy.  Betweenness centrality in large complex networks , 2003, cond-mat/0309436.

[20]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

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

[23]  Petter Holme.  Edge overload breakdown in evolving networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Ricard V. Solé,et al.  Phase Transitions in a Model of Internet Traffic , 2000 .

[25]  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.

[26]  V. Latora,et al.  Efficiency of scale-free networks: error and attack tolerance , 2002, cond-mat/0205601.

[27]  Shawn Martin,et al.  Random removal of edges from scale free graphs , 2006 .

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