Hunting for influential nodes based on radiation theory in complex networks

被引:4
作者
Wu, Hongqian [1 ]
Deng, Hongzhong [1 ]
Li, Jichao [1 ]
Wang, Yangjun [2 ]
Yang, Kewei [1 ]
机构
[1] Natl Univ Def Technol, Coll Syst Engn, Changsha 410073, Peoples R China
[2] Natl Univ Def Technol, Coll Adv Interdisciplinary Studies, Changsha 410073, Peoples R China
关键词
Vital nodes; Radiation centrality; Network propagation; Network invulnerability; Interdisciplinary analysis; CENTRALITY; SPREADERS; IDENTIFICATION; RANKING;
D O I
10.1016/j.chaos.2024.115487
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Assessing node importance is a crucial and long-standing research topic in the field of complex systems, which is vital for studying the robustness of networks and controlling network propagation. In our study, we propose a novel approach to identify influential nodes in networks by applying interdisciplinary knowledge from attenuation and scattering theories in atmospheric radiation physics. We use the attenuation theory to model information dissipation on the propagation path and the scattering theory to define information loss or gain at network nodes. Our new indicator for node importance assessment, called radiation centrality, can define the influence of network structure on node importance globally or globally-locally, depending on different parameterization schemes. To validate our approach, we rank the importance of nodes in different types of simulated networks and real networks with varying sizes using eight classical vital node identification algorithms and radiation centrality jointly. We compare these results with the node importance ranking results obtained from network propagation experiments, and apply the ranking results to network disintegration simulation experiments. We also validate our approach on a cooperative network of scientists with self-importance properties crawled by the network. Experimental results disclose the effectiveness of the radiation centrality algorithm and demonstrate that our approach can effectively distinguish the differences between nodes.
引用
收藏
页数:13
相关论文
共 52 条
[31]   Leaders in Social Networks, the Delicious Case [J].
Lue, Linyuan ;
Zhang, Yi-Cheng ;
Yeung, Chi Ho ;
Zhou, Tao .
PLOS ONE, 2011, 6 (06)
[32]  
Lü L, 2016, NAT COMMUN, V7, DOI [10.1038/ncomms10168, 10.1038/ncomms11119]
[33]   Identifying influential spreaders in complex networks based on gravity formula [J].
Ma, Ling-ling ;
Ma, Chuang ;
Zhang, Hai-Feng ;
Wang, Bing-Hong .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2016, 451 :205-212
[34]   Epidemic outbreaks in complex heterogeneous networks [J].
Moreno, Y ;
Pastor-Satorras, R ;
Vespignani, A .
EUROPEAN PHYSICAL JOURNAL B, 2002, 26 (04) :521-529
[35]   Assortative mixing in networks [J].
Newman, MEJ .
PHYSICAL REVIEW LETTERS, 2002, 89 (20)
[36]   Efficient collective influence maximization in cascading processes with first-order transitions [J].
Pei, Sen ;
Teng, Xian ;
Shaman, Jeffrey ;
Morone, Flaviano ;
Makse, Hernan A. .
SCIENTIFIC REPORTS, 2017, 7
[37]   A Social Network Analysis and Comparison of Six Dark Web Forums [J].
Pete, Ildiko ;
Hughes, Jack ;
Chua, Yi Ting ;
Bada, Maria .
2020 IEEE EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY WORKSHOPS (EUROS&PW 2020), 2020, :484-493
[38]  
[任晓龙 Ren Xiaolong], 2014, [科学通报, Chinese Science Bulletin], V59, P1175
[39]  
Rossi RA, 2015, AAAI CONF ARTIF INTE, P4292
[40]   Molecular networks as sensors and drivers of common human diseases [J].
Schadt, Eric E. .
NATURE, 2009, 461 (7261) :218-223