The Impact of Imperfect Information on Network Attack
arXiv:1412.3204 · doi:10.1103/PhysRevE.91.032807
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őos-Rényi case the effectiveness of network attack is much more degraded by missing links as compared with the same number of false links.
References in corpus (20)
- Emergence of scaling in random networks
- The structure and function of complex networks
- Community structure in social and biological networks
- Error and attack tolerance of complex networks
- Epidemic spreading in scale-free networks
- Assortative mixing in networks
- Network robustness and fragility: Percolation on random graphs
- Hierarchical structure and the prediction of missing links in networks
- Cascade-based attacks on complex networks
- Attack vulnerability of complex networks
- Immunization of complex networks
- Efficient Immunization Strategies for Computer Networks and Populations
- Mitigation of Malicious Attacks on Networks
- Mathematical Formulation of Multi-Layer Networks
- Robustness of interdependent networks under targeted attack
- Vulnerability and Protection of Critical Infrastructures
- Characterizing the dynamical importance of network nodes and links
- Efficient local strategies for vaccination and network attack
- The effect of network topology on the stability of discrete state models of genetic control
- Robustness of Network Measures to Link Errors