Natural Connectivity of Complex Networks

The concept of natural connectivity is reported as a robustness measure of complex networks. The natural connectivity has a clear physical meaning and a simple mathematical formulation. It is shown that the natural connectivity can be derived mathematically from the graph spectrum as an average eigenvalue and that it changes strictly monotonically with the addition or deletion of edges. By comparing the natural connectivity with other typical robustness measures within a scenario of edge elimination, it is demonstrated that the natural connectivity has an acute discrimination which agrees with our intuition.

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

[2]  Li Fang,et al.  Robustness of Complex Networks under Attack and Repair , 2009 .

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

[4]  Yong Li,et al.  ATTACK VULNERABILITY OF COMPLEX NETWORKS BASED ON LOCAL INFORMATION , 2007 .

[5]  Hongzhong Deng,et al.  Vulnerability of complex networks under intentional attack with incomplete information , 2007 .

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

[7]  Dieter Kratsch,et al.  Measuring the Vulnerability for Classes of Intersection Graphs , 1997, Discret. Appl. Math..

[8]  J. A. Rodríguez-Velázquez,et al.  Subgraph centrality in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  J. A. Rodríguez-Velázquez,et al.  Spectral measures of bipartivity in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Michael Doob,et al.  Spectra of graphs , 1980 .

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

[12]  Vasek Chvátal,et al.  Tough graphs and hamiltonian circuits , 1973, Discret. Math..

[13]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[14]  Béla Bollobás,et al.  Random Graphs , 1985 .

[15]  Jian-Guo Liu,et al.  Optimization of Scale-Free Network for Random Failures , 2006 .

[16]  H. A. Jung,et al.  On a class of posets and the corresponding comparability graphs , 1978, J. Comb. Theory B.

[17]  Béla Bollobás,et al.  Robustness and Vulnerability of Scale-Free Random Graphs , 2004, Internet Math..

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

[19]  Ouyang Qi,et al.  Distance Distribution and Reliability of Small-World Networks , 2001 .

[20]  Cai Xu,et al.  Stability of Random Networks under Evolution of Attack and Repair , 2006 .

[21]  Ernesto Estrada.  Characterization of 3D molecular structure , 2000 .

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

[23]  Xiao Fan Wang,et al.  Complex Networks: Topology, Dynamics and Synchronization , 2002, Int. J. Bifurc. Chaos.

[24]  Tan Yue-jin,et al.  A Robustness Model of Complex Networks with Tunable Attack Information Parameter , 2007 .

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

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

[27]  Rong Li-li,et al.  Effect Attack on Scale-Free Networks due to Cascading Failures , 2008 .