Edge-based-attack induced cascading failures on scale-free networks

Abstract

Most previous existing works on cascading failures only focused on attacks on nodes rather than on edges. In this paper, we discuss the response of scale-free networks subject to two different attacks on edges during cascading propagation, i.e., edge removal by either the descending or ascending order of the loads. Adopting a cascading model with a breakdown probability p of an overload edge and the initial load ( k i k j ) α of an edge i j , where k i and k j are the degrees of the nodes connected by the edge i j and α is a tunable parameter, we investigate the effects of two attacks for the robustness of Barabási–Albert (BA) scale-free networks against cascading failures. In the case of α < 1 , our investigation by the numerical simulations leads to a counterintuitive finding that BA scale-free networks are more sensitive to attacks on the edges with the lowest loads than the ones with the highest loads, not relating to the breakdown probability. In addition, the same effect of two attacks in the case of α = 1 may be useful in furthering studies on the control and defense of cascading failures in many real-life networks. We then confirm by the theoretical analysis these results observed in simulations.