We study the controllability of networks in the process of cascading failures under two different attacking strategies, random and intentional attack, respectively. For the highest-load edge attack, it is found that the controllability of Erdős-Rényi network, that with moderate average degree, is less robust, whereas the Scale-free network with moderate power-law exponent shows strong robustness of controllability under the same attack strategy. The vulnerability of controllability under random and intentional attacks behave differently with the increasing of removal fraction, especially, we find that the robustness of control has important role in cascades for large removal fraction. The simulation results show that for Scale-free networks with various power-law exponents, the network has larger scale of cascades do not mean that there will be more increments of driver nodes. Meanwhile, the number of driver nodes in cascading failures is also related to the edges amount in strongly connected components.
Department of Modern Physics, University of Science and Technology of China, Hefei, P. R. China;Department of Modern Physics, University of Science and Technology of China, Hefei, P. R. China;School of Mathematical Science, Anhui University, Hefei, P. R. China;Department of Mathematics and Physics, Anhui Jianzhu University, Hefei, P. R. China;Department of Modern Physics, University of Science and Technology of China, Hefei, P. R. China;College of Physics and Electronic Information Engineering, Wenzhou University, Wenzhou Zhejiang, P. R. China;School of Science, Southwest University of Science and Technology, Mianyang, Sichuan, P. R. China
Recommended Citation:
Sen Nie,Xuwen Wang,Haifeng Zhang,et al. Robustness of Controllability for Networks Based on Edge-Attack[J]. PLOS ONE,2014-01-01,9(2)