Unsupervised Strategies to Network Topology Reconfiguration Optimization with Limited Link Addition

Paiva, William R.; Martins, Paulo S.; Angelis, André Franceschi de

doi:10.1007/978-3-030-40943-2_5

Cited by 1 publication

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There is a trade-off between robustness and network efficiency in SF networks [34], whereas high robustness coexists with network efficiency in incrementally growing onion-like networks [35]. In link addition methods, several previous methods have been proposed for improving only the efficiency [20,36]. Therefore, we investigate the impact of the minimum degree and longest distance strategies on not only the robustness but also network efficiency E and diameter D defined as the maximum length of shortest paths in the network.…”

Section: Plos Onementioning

confidence: 99%

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

Chujyo

Hayashi²

2022

PLoS ONE

View full text Add to dashboard Cite

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.

show abstract