| On 2012-05-04 at 14:30:00 (Brussels Time) |
Abstract
Abstract: introduce the concept of natural connectivity as a measure of structural robustness in complex networks. The natural connectivity characterizes the redundancy of alternative routes in a network by quantifying the weighted number of closed walks of all lengths. This definition leads to a simplemathematical formulation that links the natural connectivity to the spectrum of a network. The natural connectivity can be regarded as an average eigenvalue that changes strictly monotonically with the addition or deletion of edges. We calculate both analytically and numerically the natural connectivity of three typical networks: regular ring lattices, random graphs, and random scale-free networks. We also compare the proposed natural connectivity to other structural robustness measures within a scenario of edge elimination and demonstrate that the natural connectivity provides sensitive discrimination of structural robustness that agrees with our intuition.
Keywords
Complex networks, robustness, graph spectra, natural connectivity
References
-
Jun Wu, Mauricio Barahona, Yue-Jin Tan, and Hong-Zhong Deng. (2011)
Spectral Measure of Structural Robustness in Complex Networks,
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS ART A, 41(6):1244-1252.
See http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5740372
