Bypass rewiring and robustness of complex networks
Abstract
- Bypass rewiring makes networks robust against removal of nodes including random failures and attacks.
- the even degree network is more robust than the even degree networks without random bypass.
- a greedy bypass rewiring algorithm which guarantees the maximum size of the largest component at each step.
Introduction
Mitigation methods have technical, economic or geographical problems to be implemented.
We propose a concept of bypass rewiring to make networks robust against random failure and attacks.
A concept of bypass rewiring
Bypass rewiring is to directly connect each pair of links of the removed node.
Random bypass rewiring
use generating functions based on the generating function formalism introduced in…
define:
where:
- pk is the probability that a randomly chosen node has degree k
-
-
Greedy bypass rewiring
Conclusions
Robustness analysis of bimodal networks in the whole range of degree correlation
Abstract
…
Introduction
A bimodal network is one which connects two varieties of things. It’s also called a bipartite, 2-partite, or 2-mode network.
Properties of correlated bimodel networks
A. correlation between the nearest-neighbor degrees
Pearson coefficient is a commonly used measure for the degree-degree correlation between two extra edges
B. correlation between the next-nearest-neighbor degrees
Percolation threshold
A. percolation threshold for random failure
B. percolation threshold for degree-based targeted attack