Vulnerability Analysis for Complex Networks under the Shortest Path-Attack Strategies

Abstract

Abstract-We proposed three shortest path-attack strategies and investigated the vulnerability of three complex model networks under these path-attack strategies. The experimental results indicate that the robustness of random network is the weakest, but small-world network is the strongest under the shortest pathattack strategies. We also obtain that the shortest path-attack strategies are more harmful than RPA(random augmenting approach) attack strategy. These findings supplement and extend the previous attack results and can thus help us to provide some insights into the design of more robust networks.