期刊
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS
卷 49, 期 4, 页码 821-832出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSMC.2017.2733545
关键词
Attack robustness; complex networks; complex systems; sampling
资金
- National Natural Science Foundation of China [11505127]
- Shanghai Pujiang Program [15PJ1408300]
Network measures derived from empirical observations are often poor estimators of the true structure of system as it is impossible to observe all components and all interactions in many real world complex systems. Here, we study attack robustness of complex networks with data missing caused by: 1) a uniform random sampling and 2) a nonuniform random sampling. By introducing the subgraph robustness problem, we develop analytically a framework to investigate robustness properties of the two types of subgraphs under random attacks, localized attacks, and targeted attacks. Interestingly, we find that the benchmark models, such as Erdiis-Renyi graphs, random regular networks, and scale-free networks possess distinct characteristic subgraph robustness features. We show that the network robustness depends on several factors including network topology, attack mode, sampling method and the amount of data missing, generalizing some well-known robustness principles of complex networks. Our results offer insight into the structural effect of missing data in networks and highlight the significance of understanding different sampling processes and their consequences on attack robustness, which may be instrumental in designing robust systems.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据