4.6 Article

Adding links on minimum degree and longest distance strategies for improving network robustness and efficiency

Journal

PLOS ONE
Volume 17, Issue 10, Pages -

Publisher

PUBLIC LIBRARY SCIENCE
DOI: 10.1371/journal.pone.0276733

Keywords

-

Funding

  1. Japan Society for the Promotion of Science [JP.21H03425]

Ask authors/readers for more resources

This paper investigates the impact of adding links on network robustness and finds that adding links based on the minimum degree strategy effectively improves robustness, while the longest distance strategy is only the best choice when the number of added links is small. Enhancing global loops is more important for improving robustness compared to enhancing local loops.
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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available