Graph Vulnerability and Robustness: A Survey

被引:59
作者
Freitas, Scott [1 ]
Yang, Diyi [1 ]
Kumar, Srijan [1 ]
Tong, Hanghang [2 ]
Chau, Duen Horng [1 ]
机构
[1] Georgia Inst Technol, Dept Computat Sci & Engn, Atlanta, GA 30313 USA
[2] Univ Illinois, Dept Comp Sci, Urbana, IL 61801 USA
关键词
Robustness; Conferences; Network topology; Power measurement; Data mining; Physics; Substations; Graphs; robustness; vulnerability; networks; attacks; defense; SCALE-FREE NETWORKS; COMPLEX NETWORKS; CONNECTIVITY; CENTRALITY; FAILURES; RELIABILITY; RESISTANCE; FRAGILITY; RANKING; CASCADE;
D O I
10.1109/TKDE.2022.3163672
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The study of network robustness is a critical tool in the characterization and sense making of complex interconnected systems such as infrastructure, communication and social networks. While significant research has been conducted in these areas, gaps in the surveying literature still exist. Answers to key questions are currently scattered across multiple scientific fields and numerous papers. In this survey, we distill key findings across numerous domains and provide researchers crucial access to important information by- (1) summarizing and comparing recent and classical graph robustness measures; (2) exploring which robustness measures are most applicable to different categories of networks (e.g., social, infrastructure); (3) reviewing common network attack strategies, and summarizing which attacks are most effective across different network topologies; and (4) extensive discussion on selecting defense techniques to mitigate attacks across a variety of networks. This survey guides researchers and practitioners in navigating the expansive field of network robustness, while summarizing answers to key questions. We conclude by highlighting current research directions and open problems.
引用
收藏
页码:5915 / 5934
页数:20
相关论文
共 150 条
[1]  
Aditya Prakash B., 2013, P 2013 SIAM INT C DA, P659, DOI DOI 10.1137/1.9781611972832.73
[2]  
Akoglu L, 2009, LECT NOTES ARTIF INT, V5781, P13, DOI 10.1007/978-3-642-04180-8_13
[3]   Scale-free networks in cell biology [J].
Albert, R .
JOURNAL OF CELL SCIENCE, 2005, 118 (21) :4947-4957
[4]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[5]  
Alenazi MJF, 2015, 2015 7TH INTERNATIONAL WORKSHOP ON RELIABLE NETWORKS DESIGN AND MODELING (RNDM) PROCE4EDINGS, P7, DOI 10.1109/RNDM.2015.7324302
[6]  
Alenazi MJF, 2015, I C DES RELIABL COMM, P157, DOI 10.1109/DRCN.2015.7149007
[7]  
[Anonymous], 2010, P 12 ANN C WAT DISTR
[8]   Correlation of Node Importance Measures: An Empirical Study through Graph Robustness [J].
Baig, Mirza Basim ;
Akoglu, Leman .
WWW'15 COMPANION: PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB, 2015, :275-281
[9]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[10]   Efficient and Robust Communication Topologies for Distributed Decision Making in Networked Systems [J].
Baras, John S. ;
Hovareshti, Pedram .
PROCEEDINGS OF THE 48TH IEEE CONFERENCE ON DECISION AND CONTROL, 2009 HELD JOINTLY WITH THE 2009 28TH CHINESE CONTROL CONFERENCE (CDC/CCC 2009), 2009, :3751-3756