Bypass rewiring and robustness of complex networks

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 221
  • Download : 0
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
Publisher
AMER PHYSICAL SOC
Issue Date
2016-08
Language
English
Article Type
Article
Keywords

RANDOM GRAPHS; INTERNET; ATTACK

Citation

PHYSICAL REVIEW E, v.94, no.2

ISSN
2470-0045
DOI
10.1103/PhysRevE.94.022310
URI
http://hdl.handle.net/10203/213173
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0