Attack Strategies on Complex Networks

Lazaros K. Gallos, R. Cohen, Fredrik Liljeros, Panos Argyrakis, Armin Bunde, Shlomo Havlin

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In this work, we estimate the resilience of scale-free networks on a number of different attack methods. We study a number of different cases, where we assume that a small amount of knowledge on the network structure is available, or can be approximately estimated. We also present a class of real-life networks that prove to be very resilient on intentional attacks, or equivalently much more difficult to immunize completely than most model scale-free networks.
Original languageAmerican English
Title of host publicationComputational Science – ICCS 2006
EditorsVassil N. Alexandrov, Geert Dick van Albada, Peter M. A. Sloot, Jack Dongarra
Place of PublicationBerlin Heidelberg
PublisherSpringer
Pages1048-1055
Volume3993
StatePublished - 2006

Publication series

NameLecture Notes in Computer Science

Fingerprint

Dive into the research topics of 'Attack Strategies on Complex Networks'. Together they form a unique fingerprint.

Cite this