Cargando…
Adding links on minimum degree and longest distance strategies for improving network robustness and efficiency
Many real-world networks characterized by power-law degree distributions are extremely vulnerable against malicious attacks. Therefore, it is important to obtain effective methods for strengthening the robustness of the existing networks. Previous studies have been discussed some link addition metho...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9605036/ https://www.ncbi.nlm.nih.gov/pubmed/36288333 http://dx.doi.org/10.1371/journal.pone.0276733 |
_version_ | 1784817965658537984 |
---|---|
author | Chujyo, Masaki Hayashi, Yukio |
author_facet | Chujyo, Masaki Hayashi, Yukio |
author_sort | Chujyo, Masaki |
collection | PubMed |
description | Many real-world networks characterized by power-law degree distributions are extremely vulnerable against malicious attacks. Therefore, it is important to obtain effective methods for strengthening the robustness of the existing networks. Previous studies have been discussed some link addition methods for improving the robustness. In particular, two effective strategies for selecting nodes to add links have been proposed: the minimum degree and longest distance strategies. However, it is unclear whether the effects of these strategies on the robustness are independent or not. In this paper, we investigate the contributions of these strategies to improving the robustness by adding links in distinguishing the effects of degrees and distances as much as possible. Through numerical simulation, we find that the robustness is effectively improved by adding links on the minimum degree strategy for both synthetic trees and real networks. As an exception, only when the number of added links is small, the longest distance strategy is the best. Conversely, the robustness is only slightly improved by adding links on the shortest distance strategy in many cases, even combined with the minimum degree strategy. Therefore, enhancing global loops is essential for improving the robustness rather than local loops. |
format | Online Article Text |
id | pubmed-9605036 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2022 |
publisher | Public Library of Science |
record_format | MEDLINE/PubMed |
spelling | pubmed-96050362022-10-27 Adding links on minimum degree and longest distance strategies for improving network robustness and efficiency Chujyo, Masaki Hayashi, Yukio PLoS One Research Article Many real-world networks characterized by power-law degree distributions are extremely vulnerable against malicious attacks. Therefore, it is important to obtain effective methods for strengthening the robustness of the existing networks. Previous studies have been discussed some link addition methods for improving the robustness. In particular, two effective strategies for selecting nodes to add links have been proposed: the minimum degree and longest distance strategies. However, it is unclear whether the effects of these strategies on the robustness are independent or not. In this paper, we investigate the contributions of these strategies to improving the robustness by adding links in distinguishing the effects of degrees and distances as much as possible. Through numerical simulation, we find that the robustness is effectively improved by adding links on the minimum degree strategy for both synthetic trees and real networks. As an exception, only when the number of added links is small, the longest distance strategy is the best. Conversely, the robustness is only slightly improved by adding links on the shortest distance strategy in many cases, even combined with the minimum degree strategy. Therefore, enhancing global loops is essential for improving the robustness rather than local loops. Public Library of Science 2022-10-26 /pmc/articles/PMC9605036/ /pubmed/36288333 http://dx.doi.org/10.1371/journal.pone.0276733 Text en © 2022 Chujyo, Hayashi https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. |
spellingShingle | Research Article Chujyo, Masaki Hayashi, Yukio Adding links on minimum degree and longest distance strategies for improving network robustness and efficiency |
title | Adding links on minimum degree and longest distance strategies for improving network robustness and efficiency |
title_full | Adding links on minimum degree and longest distance strategies for improving network robustness and efficiency |
title_fullStr | Adding links on minimum degree and longest distance strategies for improving network robustness and efficiency |
title_full_unstemmed | Adding links on minimum degree and longest distance strategies for improving network robustness and efficiency |
title_short | Adding links on minimum degree and longest distance strategies for improving network robustness and efficiency |
title_sort | adding links on minimum degree and longest distance strategies for improving network robustness and efficiency |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9605036/ https://www.ncbi.nlm.nih.gov/pubmed/36288333 http://dx.doi.org/10.1371/journal.pone.0276733 |
work_keys_str_mv | AT chujyomasaki addinglinksonminimumdegreeandlongestdistancestrategiesforimprovingnetworkrobustnessandefficiency AT hayashiyukio addinglinksonminimumdegreeandlongestdistancestrategiesforimprovingnetworkrobustnessandefficiency |