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

Attack Vulnerability of Complex Networks in Center-Based Strategies (1712.04107v2)

Published 12 Dec 2017 in cs.SI, cs.DM, and physics.soc-ph

Abstract: Central nodes are critical in establishing structural connectivity in a complex network. Attacking such nodes can create real havoc in a complex system. We propose attack strategies based on four types of centers, namely betweenness center, degree center, median, and center. We study the vulnerability of synthetic as well as real-world networks in these center-based attacks. These attacks are node-removal attacks which involve identifying the central node set and removing them from the network. We observed that the attacks based on recalculated network information are more efficient than ones based on initial network information. This work shows that the median-based attack, which is a novel strategy proposed in this work, is highly destructive in real as well as synthetic networks.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Divya Sindhu Lekha (4 papers)
  2. Kannan Balakrishnan (13 papers)
Citations (1)

Summary

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