Underestimated cost of targeted attacks on complex networks

  title={Underestimated cost of targeted attacks on complex networks},
  author={Xiaolong Ren and Niels Gleinig and Dijana Tolic and Nino Antulov-Fantulin},
The robustness of complex networks under targeted attacks is deeply connected to the resilience of complex systems, i.e., the ability to make appropriate responses to the attacks. In this article, we investigated the state-of-the-art targeted node attack algorithms and demonstrate that they become very inefficient when the cost of the attack is taken into consideration. In this paper, we made explicit assumption that the cost of removing a node is proportional to the number of adjacent links… 

Figures and Tables from this paper

Interdependency and Vulnerability of Multipartite Networks under Target Node Attacks
This study investigates the robustness of multipartite networks under intentional node attacks and discovers that larger number of partite sets of a multipartites network could increase its robustness which is opposite to the phenomenon observed on multilayer networks.
Revisiting the power of reinsertion for optimal targets of network attack
The comprehensive ablation results show that HBA is the most effective network dismantling strategy, however, it can only be applicable in small scale networks; HDA (High Degree Adaption, with reinsertion) achieves the best balance between effectiveness and efficiency.
Percolation Theories for Multipartite Networked Systems under Random Failures
This paper establishes two network models to describe how cascading failures propagate on multipartite networks subject to random node failures and adopts the largest connected component concept to quantify the networks’ robustness.
Inverse Percolation to Quantify Robustness in Multiplex Networks
This work proposes a modified version of the mathematical model for the multiplex-vertex separator problem (m-VSP), and presents an analysis using a set of multiplex social networks modeled with information about the main characteristics of the best universities in the world and the universities in Mexico.
Generalized network dismantling
This paper proposes a generalized network-dismantling framework, which can take realistic removal costs into account such as the node price, the protection level, or removal energy, and shows that nonunit costs imply a significantly different dismantling strategy.
Enhancing the Robustness of Airport Networks By Removing Links
A single-objective genetic algorithm is developed to locate the links of an airport network whose removal will increase its robustness in face of perturbations and provides a new perspective for aviation decision makers to manage airports and air routes.
Topology, robustness, and structural controllability of the Brazilian Federal Police criminal intelligence network
It is shown that 20% of driver nodes can control dynamic variables acting on the whole network, suggesting that non-repressive strategies such as access to basic education or sanitation can be effective in reducing criminality by changing the perception of driver individuals to norm compliance.
Analysis and Characterization of the Spread of COVID-19 in Mexico through Complex Networks and Optimization Approaches
This work analyzes and characterizes the spread of the COVID-19 disease in Mexico, using complex networks and optimization approaches. Specifically, we present two methodologies based on the
Dismantling Networks by Skeleton Extraction and Greedy Tree Breaking
This paper proposes a novel network dismantling algorithm that combines skeleton extraction and greedy tree breaking (SEGTB), which is both effective and efficient, outperforming the state-of-the-art.


The cost of attack in competing networks
A conservation law is defined that relates the feedback mechanism to the resilience dynamics for two competing networks and determines the cost and optimal duration of an attack, allowing a network to evaluate the risk of initiating hostilities.
Attack vulnerability of complex networks.
It is found that the removals by the recalculated degrees and betweenness centralities are often more harmful than the attack strategies based on the initial network, suggesting that the network structure changes as important vertices or edges are removed.
Optimization of network robustness to waves of targeted and random attacks.
We study the robustness of complex networks to multiple waves of simultaneous (i) targeted attacks in which the highest degree nodes are removed and (ii) random attacks (or failures) in which
Breakdown of the internet under intentional attack.
It is argued that, near criticality, the average distance between sites in the spanning (largest) cluster scales with its mass, M, as square root of [M], rather than as log (k)M, as expected for random networks away from criticality.
Fast Fragmentation of Networks Using Module-Based Attacks
It is shown that the module-based approach always outperforms targeted attacks to vertices based on node degree or betweenness centrality rankings, with gains in efficiency strongly related to the modularity of the network.
Influence maximization in complex networks through optimal percolation
This work maps the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network.
Identifying optimal targets of network attack by belief propagation
This work applies the BPD algorithm (which has approximately linear time complexity) to the network optimal attack problem and demonstrates that it has much better performance than a recently proposed collective information algorithm.
Network dismantling
The size of the optimal dismantling set for random networks is given, an efficient dismantling algorithm for general networks that outperforms by a large margin existing strategies is proposed, and additional insights are provided into the dismantling problem.
Optimal cost for strengthening or destroying a given network.
A method for strengthening or destroying a random network with a minimum cost is developed and it is found that the list of priorities of degrees is universal and independent of the network's degree distribution, for all kinds of random networks.