Survivability analysis of weighted-edge attacks on complex networks with incomplete information

We study the survivability of weighted-edge attacks with incomplete information on a free-scale network. We consider a situation where attackers can detect partial edges of the network, and the information regarding the detected edges may be imprecise. Random and intentional attacks are the two extreme cases of this investigation. In this article, edge betweenness is adopted to describe the weight of an edge. Based on this, α is employed as the parameter describing the scope of edges that can be detected from the network and β as the parameter depicting the accuracy of the already detected edge weight information. Attack strategies that are different from both random and targeted attacks are designed for a scale-free network with incomplete information. Numerical simulations are performed and results are obtained: (i) a larger α or β can worsen both the network connectivity and efficiency while confronting attacks; (ii) when α is small, β has a relatively small impact on the network connectivity ς, but with the increase in α, both α and β both play important roles in it; (iii) β consistently plays an important role in network efficiency, regardless of the value of α. The results of this article are helpful for the future development of effective protection strategies in scale-free networks as it is more convenient and realistic to protect network information than to adjust the network structural topology.