A Survey on Centrality Metrics and Their Network Resilience Analysis

被引:56
作者
Wan, Zelin [1 ]
Mahajan, Yash [1 ]
Kang, Beom Woo [2 ]
Moore, Terrence J. [3 ]
Cho, Jin-Hee [1 ]
机构
[1] Virginia Tech, Dept Comp Sci, Blacksburg, VA 24061 USA
[2] Hanyang Univ, Dept Elect Engn, Seoul 04763, South Korea
[3] US Army Res Lab, Adelphi, MD 20783 USA
关键词
Measurement; Resilience; Proteins; Social networking (online); Particle measurements; Atmospheric measurements; Communication networks; Centrality; networks; influence; importance; attacks; network resilience; network science; IDENTIFYING INFLUENTIAL NODES; ONLINE SOCIAL NETWORKS; COMPLEX NETWORKS; INFORMATION DIFFUSION; COMMUNITY STRUCTURE; FOUNDER CENTRALITY; FAMILY FIRMS; ISNT ALWAYS; SPREADERS; RANKING;
D O I
10.1109/ACCESS.2021.3094196
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Centrality metrics have been studied in the network science research. They have been used in various networks, such as communication, social, biological, geographic, or contact networks under different disciplines. In particular, centrality metrics have been used in order to study and analyze targeted attack behaviors and investigated their effect on network resilience. Although a rich volume of centrality metrics has been developed from 1940s, only some centrality metrics (e.g., degree, betweenness, or cluster coefficient) have been commonly in use. This paper aims to introduce various existing centrality metrics and discusses their applicabilities in various networks. In addition, we conducted extensive simulation study in order to demonstrate and analyze the network resilience of targeted attacks using the surveyed centrality metrics under four real network topologies. We also discussed algorithmic complexity of centrality metrics surveyed in this work. Through the extensive experiments and discussions of the surveyed centrality metrics, we encourage their use in solving various computing and engineering problems in networks.
引用
收藏
页码:104773 / 104819
页数:47
相关论文
共 222 条
[111]   Blocking Links to Minimize Contamination Spread in a Social Network [J].
Kimura, Masahiro ;
Saito, Kazumi ;
Motoda, Hiroshi .
ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2009, 3 (02)
[112]   Extracting influential nodes on a social network for information diffusion [J].
Kimura, Masahiro ;
Saito, Kazumi ;
Nakano, Ryohei ;
Motoda, Hiroshi .
DATA MINING AND KNOWLEDGE DISCOVERY, 2010, 20 (01) :70-97
[113]  
Kitsak M, 2010, NAT PHYS, V6, P888, DOI [10.1038/NPHYS1746, 10.1038/nphys1746]
[114]   Social activity and structural centrality in online social networks [J].
Klein, Andreas ;
Ahlf, Henning ;
Sharma, Varinder .
TELEMATICS AND INFORMATICS, 2015, 32 (02) :321-332
[115]   Centrality measure in graphs [J].
Klein, D. J. .
JOURNAL OF MATHEMATICAL CHEMISTRY, 2010, 47 (04) :1209-1223
[116]   Authoritative sources in a hyperlinked environment [J].
Kleinberg, JM .
JOURNAL OF THE ACM, 1999, 46 (05) :604-632
[117]  
Kleinrock L., 1978, P IEEE NAT TEL C, V4, P1
[118]   A measure of individual role in collective dynamics [J].
Klemm, Konstantin ;
Angeles Serrano, M. ;
Eguiluz, Victor M. ;
San Miguel, Maxi .
SCIENTIFIC REPORTS, 2012, 2
[119]  
Knill O., 2012, ARXIV12024514
[120]   Lobby index in networks [J].
Korn, A. ;
Schubert, A. ;
Telcs, A. .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2009, 388 (11) :2221-2226