Journal ArticleDOI
Spectral Measure of Structural Robustness in Complex Networks
Jun Wu,Mauricio Barahona,Yuejin Tan,Hongzhong Deng +3 more
- Vol. 41, Iss: 6, pp 1244-1252
Reads0
Chats0
TLDR
The proposed natural connectivity provides sensitive discrimination of structural robustness that agrees with intuition within a scenario of edge elimination and is calculated both analytically and numerically the natural connectivity of three typical networks.Abstract:
We 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 simple mathematical 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.read more
Citations
More filters
Journal ArticleDOI
A Critical Review of Robustness in Power Grids Using Complex Networks Concepts
TL;DR: In this article, the authors review the most relevant works that have investigated robustness in power grids using complex networks (CN) concepts, and propose strategies to improve robustness such as intentional islanding, restricted link addition, and more efficient electrical metrics such as electrical betweenness, net-ability and others.
Journal ArticleDOI
A memetic algorithm for enhancing the robustness of scale-free networks against malicious attacks
Mingxing Zhou,Jing Liu +1 more
TL;DR: A new memetic algorithm (MA), which is a type of effective optimization method combining both global and local searches, is proposed to enhance the robustness of scale-free (RSF) networks against malicious attacks (MA) without changing the degree distribution.
Journal ArticleDOI
Robustness of interdependent networks with different link patterns against cascading failures
TL;DR: It is numerically found that both the different link patterns and the parameters in the cascading model have important effects on dramatically improving the robustness of the interdependent networks against cascading failures and the better link pattern and the matching network structure to effectively avoid the cascades propagation.
Journal ArticleDOI
Optimal network topology for structural robustness based on natural connectivity
Guan-sheng Peng,Jun Wu +1 more
TL;DR: A tabu search algorithm to optimize the structural robustness of a given network by rewiring the links and fixing the node degrees to maximize a newStructural robustness measure, natural connectivity, which provides a sensitive and reliable measure of the structural resilientness of complex networks and has lower computation complexity.
Journal ArticleDOI
Robustness of complex networks with the local protection strategy against cascading failures
TL;DR: Numerically find the optimal value of the parameter, at which two types of networks can reach the strongest robust level against cascading failures, and verify this finding by theoretical analysis in BA networks.
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI
Emergence of Scaling in Random Networks
TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Journal ArticleDOI
Error and attack tolerance of complex networks
TL;DR: It is found that scale-free networks, which include the World-Wide Web, the Internet, social networks and cells, display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected even by unrealistically high failure rates.