Revisiting the Robustness of Complex Networks against Random Node Removal
-
- Yamashita Kazuyuki
- Department of Informatics, School of Science and Technology, Kwansei Gakuin University
-
- Yasuda Yuichi
- Department of Informatics, Graduate School of Science and Technology, Kwansei Gakuin University
-
- Nakamura Ryo
- Department of Informatics, Graduate School of Science and Technology, Kwansei Gakuin University
-
- Ohsaki Hiroyuki
- Department of Informatics, Graduate School of Science and Technology, Kwansei Gakuin University
抄録
<p>It is widely known that scale-free networks are robust against random node removal, which is one of major interesting findings in network science. This suggests that, for instance, communication networks such as the Internet is robust against random node failures caused by breakdowns and/or malicious attacks if their network topologies are scale-free networks. Generally, the ratio of failed devices (e.g., routers) to operational devices is not extremely high. In this paper, we revisit the robustness of complex networks against random node removal. Through simulations, we compare the robustness of scale-free and non-scale-free networks against random node removal as well as random edge removal. Our findings include that, contrary to common understanding, non-scale-free networks are more robust than scale-free networks except under extremely high node removal ratio. We also show that the robustness of non-scale-free networks can be further improved by bounding the minimum node degree of those networks.</p>
収録刊行物
-
- Journal of Information Processing
-
Journal of Information Processing 27 (0), 643-649, 2019
一般社団法人 情報処理学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1390282752326122496
-
- NII論文ID
- 130007706921
-
- ISSN
- 18826652
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- Crossref
- CiNii Articles
- KAKEN
-
- 抄録ライセンスフラグ
- 使用不可