Network resilience against intelligent attacks constrained by degree dependent node removal cost

Abstract

We study the resilience of complex networks against attacks in which nodes are targeted intelligently, but where disabling a node has a cost to the attacker which depends on its degree. Attackers have to meet these costs with limited resources, which constrains their actions. A network's integrity is quantified in terms of the efficacy of the process that it supports. We calculate how the optimal attack strategy and the most attack-resistant network degree statistics depend on the node removal cost function and the attack resources. The resilience of networks against intelligent attacks is found to depend strongly on the node removal cost function faced by the attacker. In particular, if node removal costs increase sufficiently fast with the node degree, power law networks are found to be more resilient than Poissonian ones, even against optimized intelligent attacks.

28 pages, 5 figures

References in corpus (7)

• Optimization of Robustness of Complex Networks
• Entropies of complex networks with hierarchically constrained topologies
• Finitely connected vector spin systems with random matrix interactions
• Tailored graph ensembles as proxies or null models for real networks I: tools for quantifying structure
• Cavity approach for real variables on diluted graphs and application to synchronization in small-world lattices
• Spin models on random graphs with controlled topologies beyond degree constraints
• Diluted antiferromagnet in a ferromagnetic enviroment

Cited by in corpus (8)

• Robustness of interdependent networks under targeted attack
• Extensive load in multitasking associative networks
• Network Observability Transitions
• Extinction-induced community reorganization in bipartite networks
• Heterogeneity in Outcomes of Repeated Instances of Percolation Experiments
• Connected components in networks with higher-order interactions
• Uncovering the non-equilibrium stationary properties in sparse Boolean networks
• Overcoming the complexity barrier of the dynamic message-passing method in networks with fat-tailed degree distributions