Underestimated Cost of Targeted Attacks on Complex Networks. (17th January 2018)

• Record Type: Journal Article
• Authors: Ren, Xiao-Long; Gleinig, Niels; Tolić, Dijana; Antulov-Fantulin, Nino
• Other Names: Giannoccaro Ilaria Academic Editor.
• Is Part Of: Complexity. Volume 2018(2018)
• Publication Date: 2018-01-17
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2018/9826243
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : The robustness of complex networks under targeted attacks is deeply connected to the resilience of complex systems, which is defined as the ability to make appropriate response to the attack. In this paper, we study robustness of complex networks under a realistic assumption that the cost of removing a node is not constant but rather proportional to the degree of a node or equivalently to the number of removed links a removal action produces. We have investigated the state-of-the-art targeted node removing algorithms and demonstrate that they become very inefficient when the cost of the attack is taken into consideration. For the case when it is possible to attack or remove links, we propose a simple and efficient edge removal strategy named Hierarchical Power Iterative Normalized cut (HPI-Ncut). The results on real and artificial networks show that the HPI-Ncut algorithm outperforms all the node removal and link removal attack algorithms when the same definition of cost is taken into consideration. In addition, we show that, on sparse networks, the complexity of this hierarchical power iteration edge removal algorithm is only O n log 2 + ε ⁡ n .