Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 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

Generating Robust and Efficient Networks Under Targeted Attacks (1207.1291v2)

Published 5 Jul 2012 in physics.soc-ph and cs.SI

Abstract: Much of our commerce and traveling depend on the efficient operation of large scale networks. Some of those, such as electric power grids, transportation systems, communication networks, and others, must maintain their efficiency even after several failures, or malicious attacks. We outline a procedure that modifies any given network to enhance its robustness, defined as the size of its largest connected component after a succession of attacks, whilst keeping a high efficiency, described in terms of the shortest paths among nodes. We also show that this generated set of networks is very similar to networks optimized for robustness in several aspects such as high assortativity and the presence of an onion-like structure.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Vitor H. P. Louzada (2 papers)
  2. Fabio Daolio (10 papers)
  3. Hans J. Herrmann (120 papers)
  4. Marco Tomassini (29 papers)
Citations (37)

Summary

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