Bypass rewiring and robustness of complex networks

Abstract

A concept of bypass rewiring is introduced and random bypass rewiring is analytically and numerically investigated with simulations. Our results show that bypass rewiring makes networks robust against removal of nodes including random failures and attacks. In particular, random bypass rewiring connects all nodes except the removed nodes on an even degree infinite network and makes the percolation threshold 0 for arbitrary occupation probabilities. In our example, the even degree network is more robust than the original network with random bypass rewiring while the original network is more robust than the even degree networks without random bypass. We propose a greedy bypass rewiring algorithm which guarantees the maximum size of the largest component at each step, assuming which node will be removed next is unknown. The simulation result shows that the greedy bypass rewiring algorithm improves the robustness of the autonomous system of the Internet under attacks more than random bypass rewiring.

References in corpus (15)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• Error and attack tolerance of complex networks
• Random graphs with arbitrary degree distributions and their applications
• Evolution of networks
• Network robustness and fragility: Percolation on random graphs
• Resilience of the Internet to random breakdowns
• Critical phenomena in complex networks
• Attack vulnerability of complex networks
• Breakdown of the Internet under intentional attack
• Mitigation of Malicious Attacks on Networks
• Centrality Measures in Spatial Networks of Urban Streets
• Is the Boston subway a small-world network ?
• Stability and topology of scale-free networks under attack and defense strategies
• Self-healing networks: redundancy and structure

Cited by in corpus (5)

• Structural Robustness of Complex Networks: A Survey of A Posteriori Measures
• A new design principle of robust onion-like networks self-organized in growth
• Effective Self-Healing Networks against Attacks or Disasters in Resource Allocation Control
• Optimally coordinated traffic diversion by statistical physics
• More Tolerant Reconstructed Networks by Self-Healing against Attacks in Saving Resource