title: Impact of imperfect information on network attack.
abstract: This paper explores the effectiveness of network attack when the attacker has imperfect information about the network. For Erdős-Rényi networks, we observe that dynamical importance and betweenness centrality-based attacks are surprisingly robust to the presence of a moderate amount of imperfect information and are more effective compared with simpler degree-based attacks even at moderate levels of network information error. In contrast, for scale-free networks the effectiveness of attack is much less degraded by a moderate level of information error. Furthermore, in the Erdős-Rényi case the effectiveness of network attack is much more degraded by missing links as compared with the same number of false links.
authors: Institute for Research in Electronics and Applied Physics, University of Maryland, College Park, Maryland 20742, USA.|University of Rochester, Rochester, New York 14627, USA.
authors: Andrew
authors: A
authors: Melchionna
authors: Institute for Research in Electronics and Applied Physics, University of Maryland, College Park, Maryland 20742, USA.|Boise State University, Boise, Idaho 83725, USA.
authors: Jesus
authors: J
authors: Caloca
authors: Institute for Research in Electronics and Applied Physics, University of Maryland, College Park, Maryland 20742, USA.
authors: Shane
authors: S
authors: Squires
authors: Institute for Research in Electronics and Applied Physics, University of Maryland, College Park, Maryland 20742, USA.
authors: Thomas M
authors: TM
authors: Antonsen
authors: Institute for Research in Electronics and Applied Physics, University of Maryland, College Park, Maryland 20742, USA.
authors: Edward
authors: E
authors: Ott
authors: Institute for Research in Electronics and Applied Physics, University of Maryland, College Park, Maryland 20742, USA.
authors: Michelle
authors: M
authors: Girvan
mesh_terms: D008962:Models, Theoretical