Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The cost of attack in competing networks (1501.04348v2)

Published 18 Jan 2015 in cs.SI and physics.soc-ph

Abstract: Real-world attacks can be interpreted as the result of competitive interactions between networks, ranging from predator-prey networks to networks of countries under economic sanctions. Although the purpose of an attack is to damage a target network, it also curtails the ability of the attacker, which must choose the duration and magnitude of an attack to avoid negative impacts on its own functioning. Nevertheless, despite the large number of studies on interconnected networks, the consequences of initiating an attack have never been studied. Here, we address this issue by introducing a model of network competition where a resilient network is willing to partially weaken its own resilience in order to more severely damage a less resilient competitor. The attacking network can take over the competitor nodes after their long inactivity. However, due to a feedback mechanism the takeovers weaken the resilience of the attacking network. We define a conservation law that relates the feedback mechanism to the resilience dynamics for two competing networks. Within this formalism, we determine the cost and optimal duration of an attack, allowing a network to evaluate the risk of initiating hostilities.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Boris Podobnik (23 papers)
  2. Tomislav Lipic (5 papers)
  3. Javier M. Buldu (3 papers)
  4. H. Eugene Stanley (129 papers)
  5. Davor Horvatic (8 papers)
  6. Matjaz Perc (161 papers)
Citations (44)

Summary

We haven't generated a summary for this paper yet.