Influential node detection of social networks based on network invulnerability

被引:9
作者
Chen, Gaolin [1 ]
Zhou, Shuming [1 ,2 ]
Liu, Jiafei [1 ]
Li, Min [1 ]
Zhou, Qianru [1 ]
机构
[1] Fujian Normal Univ, Coll Math & Informat, Fuzhou 350117, Fujian, Peoples R China
[2] Fujian Normal Univ, Fujian Prov Key Lab Network Secur & Cryptol, Fuzhou 350007, Fujian, Peoples R China
基金
中国国家自然科学基金;
关键词
Social network; Influential nodes; Invulnerability; Global efficiency; Local efficiency; COMPLEX NETWORKS; RANKING; IDENTIFICATION; CENTRALITY; SPREADERS;
D O I
10.1016/j.physleta.2020.126879
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Detecting influential nodes is still a popular issue in social networks and many excellent detecting methods have been put forward. However, most of them aim to improve the accuracy and efficiency of the algorithm, but ignore invulnerability of networks. Based on essential factors of influence propagation (such as the location and neighborhood of source node, propagation rate) and network invulnerability, we propose a novel strategy to search the influential nodes in terms of the local topology and the global location. Two important indicators are node diffusion degree and node cohesion degree, which are used to increase the probability of influence diffusion and reduce the feasibility of network collapse. More specially, the loss of global efficiency and the loss of local efficiency are applied to evaluate the impact of the algorithm from the perspective of network invulnerability. The experimental results in the real networks show that our method achieves an excellent balance between detecting accuracy and network invulnerability. The detected influential nodes are the ones that have great influence and can resist certain damage and disturbance of the networks. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:10
相关论文
共 46 条
[1]   Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth [J].
Addis, Bernardetta ;
Di Summa, Marco ;
Grosso, Andrea .
DISCRETE APPLIED MATHEMATICS, 2013, 161 (16-17) :2349-2360
[2]  
[Anonymous], 2017, INF NETW DAT
[3]  
[Anonymous], 2017, PROT NETW DAT
[4]  
[Anonymous], 2017, ZACH KAR CLUB NETW D
[5]   Detecting critical nodes in sparse graphs [J].
Arulselvan, Ashwin ;
Commander, Clayton W. ;
Elefteriadou, Lily ;
Pardalos, Panos M. .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (07) :2193-2200
[6]   Identifying and ranking influential spreaders in complex networks by neighborhood coreness [J].
Bae, Joonhyun ;
Kim, Sangwook .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 395 :549-559
[7]  
Brin S, 2012, COMPUT NETW, V56, P3825, DOI 10.1016/j.comnet.2012.10.007
[8]   Thresholds for Epidemic Spreading in Networks [J].
Castellano, Claudio ;
Pastor-Satorras, Romualdo .
PHYSICAL REVIEW LETTERS, 2010, 105 (21)
[9]   Identifying influential nodes in complex networks [J].
Chen, Duanbing ;
Lu, Linyuan ;
Shang, Ming-Sheng ;
Zhang, Yi-Cheng ;
Zhou, Tao .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) :1777-1787
[10]  
Chen Y., 2004, HIGH TECHNOLOGY LETT, V1, P573