Bypass rewiring and robustness of complex networks우회 재배선과 복잡계 네트워크의 견고성

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 794
  • 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 (strongly) connects all nodes except the removed nodes on an infinite Eulerian networks 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 results show that the greedy bypass rewiring algorithm improves the robustness of the autonomous system of the Internet and the electrical power grid under attacks more than random bypass rewiring.
Advisors
Hahn, Sang Geunresearcher한상근researcher
Description
한국과학기술원 :정보보호대학원,
Publisher
한국과학기술원
Issue Date
2017
Identifier
325007
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 정보보호대학원, 2017.2,[ii, 28 p. :]

Keywords

bypass; rewiring; percolation; robustness; complex networks; 우회 재배선; 강인함; 견고성; 퍼콜레이션; 복잡계 네트워크

URI
http://hdl.handle.net/10203/242102
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=675863&flag=dissertation
Appears in Collection
IS-Theses_Ph.D.(박사논문)
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