Percolation of localized attack on complex networks

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 gr...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Shao, Shuai, Huang, Xuqing, Stanley, H Eugene, Havlin, Shlomo
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 09.12.2014
Subjects
Computer Science - Social and Information Networks
Cybersecurity
Networks
Percolation
Physics - Data Analysis, Statistics and Probability
Physics - Physics and Society
Robustness (mathematics)
Online AccessGet full text

Cover

More Information
Summary: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 Erdős-R\'{e}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.
ISSN:2331-8422
DOI:10.48550/arxiv.1412.3124