Hunting for influential nodes based on radiation theory in complex networks

被引:0
作者
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 条
  • [1] Identifying and ranking influential spreaders in complex networks by neighborhood coreness
    Bae, Joonhyun
    Kim, Sangwook
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 395 : 549 - 559
  • [2] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [3] FACTORING AND WEIGHTING APPROACHES TO STATUS SCORES AND CLIQUE IDENTIFICATION
    BONACICH, P
    [J]. JOURNAL OF MATHEMATICAL SOCIOLOGY, 1972, 2 (01) : 113 - 120
  • [4] The anatomy of a large-scale hypertextual Web search engine
    Brin, S
    Page, L
    [J]. COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7): : 107 - 117
  • [5] Identifying influential nodes in complex networks
    Chen, Duanbing
    Lu, Linyuan
    Shang, Ming-Sheng
    Zhang, Yi-Cheng
    Zhou, Tao
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) : 1777 - 1787
  • [6] Identifying influential nodes in complex networks based on a spreading influence related centrality
    Chen, Xing
    Tan, Mian
    Zhao, Jing
    Yang, Tinghong
    Wu, Duzhi
    Zhao, Rulan
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2019, 536
  • [7] [陈勇 Chen Yong], 2004, [通信学报, Journal of China Institute of Communications], V25, P129
  • [8] Residual closeness in networks
    Dangalchev, Chavdar
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2006, 365 (02) : 556 - 564
  • [9] RANDOM NETWORKS WITH SUBLINEAR PREFERENTIAL ATTACHMENT: THE GIANT COMPONENT
    Dereich, Steffen
    Moerters, Peter
    [J]. ANNALS OF PROBABILITY, 2013, 41 (01) : 329 - 384
  • [10] Hunting for vital nodes in complex networks using local information
    Dong, Zhihao
    Chen, Yuanzhu
    Tricco, Terrence S.
    Li, Cheng
    Hu, Ting
    [J]. SCIENTIFIC REPORTS, 2021, 11 (01)