The Research On Static Robustness Of Complex Networks Based On Edge Attack

In recent years,complex network research has gradually become the focus of attention of researchers in various fields.All kinds of complex systems in life have brought great convenience to our lives.But these complex networks also have great potential for security.Therefore,the study of the robustness of complex networks is very important.The main research work in this paper is as follows:(1)The researches on the efficiency of betweenness attack strategies for complex networks often ignored the node's attack cost in the past.Aiming at this problem,a method of complex network node attack with betweenness cost was proposed in this paper.In this method,we used node's betweenness to approximately measure the attack cost and the cost was assumed to be positively correlated to the node's betweenness.We used three different node's betweenness removal strategies to attack the networks.We investigated the influence of this method for the network robustness.Results show that when the attack cost is measured by node's betweenness,the better attack effect can be achieved if we attack the nodes that have smaller betweenness value for scale-free networks.(2)The researches on the efficiency of edge attack strategies for complex networks often ignored the edge's attack cost in the past.Aiming at this problem,a new method of network robustness based on edge's cost was proposed in this paper.Edge's weight is used to approximately measure the attack cost of edges.The robustness of synthetic datasets and real networks is investigated when the attack cost of edges is present.Moreover,the impacts of edge's weight on network robustness are discussed.The experimental results show that when the edge's attack cost is low,the attack effect of low-weight removal strategy(LW)is the best for complex networks.The robustness of real networks can be optimized by adjusting the edge's weights.(3)The two methods(1)and(2)are combined.A tunable scale-free network attack method with cost was proposed.We investigated the relation between scale-free network's power-law exponent,average degree and network robustness.When adopting the intentional attack strategy and fixing the cost value of nodes(edges),the experimental results show that the network's robustness is stronger if the power-law exponent of scale-free networks is smaller or the average degree of scale-free networks is larger.Compared with existing methods,our method may be more practical for investigating the network robustness.Simulation results show the validity and feasibility of the method.