Abstract
The robustness of complex networks against node failure and malicious attack has been of interest for decades, while most of the research has focused on random attack or hub-targeted attack. In many real-world scenarios, however, attacks are neither random nor hub-targeted, but localized, where a group of neighboring nodes in a network are attacked and fail. In this paper we develop a percolation framework to analytically and numerically study the robustness of complex networks against such localized attack. In particular, we investigate this robustness in Erds-Rényi networks, random-regular networks, and scale-free networks. Our results provide insight into how to better protect networks, enhance cybersecurity, and facilitate the design of more robust infrastructures.
Original language | English |
---|---|
Article number | 023049 |
Journal | New Journal of Physics |
Volume | 17 |
DOIs | |
State | Published - 18 Feb 2015 |
Bibliographical note
Publisher Copyright:© 2015 IOP Publishing Ltd and Deutsche Physikalische Gesellschaft.
Funding
Funders | Funder number |
---|---|
Defense Threat Reduction Agency | HDTRA-1-09-1-0035, HDTRA-1-10-1-0014 |
National Stroke Foundation | CMMI1125290 |
Office of Naval Research | N00014-09-1-0380, N00014-12-1-0548, N62909-14-1-019 |
Directorate for Engineering | 1125290 |
Keywords
- ErdosRenyi network
- complex network
- generating function
- localized attack
- percolation theory
- robustness of network
- scale-free network