Finding Key Node Sets in Complex Networks Based on Improved Discrete Fireworks Algorithm  

作　　者：LIU Fengzeng XIAO Bing LI Hao 

机构地区：[1]Air Force Early-Warning Academy,Wuhan 430019,China [2]Academy of Information and Communication,National University of Defense Technology,Wuhan 430010,China

出　　处：《Journal of Systems Science & Complexity》2021年第3期1014-1027,共14页系统科学与复杂性学报（英文版）

基　　金：supported by the National Natural Science Foundation of China under Grant No.61502522。

摘　　要：Finding out the key node sets that affect network robustness has great practical significance for network protection and network disintegration.In this paper,the problem of finding key node sets in complex networks is defined firstly.Because it is an NP-hard combinatorial optimization problem,discrete fireworks algorithm is introduced to search the optimal solution,which is a swarm intelligence algorithm and is improved by the prior information of networks.To verify the effect of improved discrete fireworks algorithm(IDFA),experiments are carried out on various model networks and real power grid.Results show that the proposed IDFA is obviously superior to the benchmark algorithms,and networks suffer more damage when the key node sets obtained by IDFA are removed from the networks.The key node sets found by IDFA contain a large number of non-central nodes,which provides the authors a new perspective that the seemingly insignificant nodes may also have an important impact on the robustness of the network.

关 键 词：Complex networks discrete fireworks algorithm key node sets network robustness node centrality 

分 类 号：O157.5[理学—数学]