Influential nodes identification for complex networks based on multi-feature fusion

被引:0
作者
Li, Shaobao [1 ]
Quan, Yiran [1 ]
Luo, Xiaoyuan [1 ]
Wang, Juan [1 ]
机构
[1] Yanshan Univ, Sch Elect Engn, Qinhuangdao 066004, Peoples R China
基金
中国国家自然科学基金;
关键词
Complex networks; Influential node identification; Betweenness centrality; k-shell algorithm; Gravity model; SOCIAL NETWORKS; USERS; CENTRALITY; SPREADERS;
D O I
10.1038/s41598-025-94193-w
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
dentifying critical nodes in complex networks presents a significant challenge that has garnered extensive research attention. Previous studies often overlook the importance of spatial information, thereby limiting the accurate identification of key nodes. To address this gap, we introduce an advanced centrality model, termed Degree-k-shell-Betweenness Centrality (DKBC), which is grounded in the principle of gravity. The DKBC model integrates the centrality attributes of node degree, spatial positioning, and intermediate degree, resulting in improved accuracy for key node identification in complex networks. This innovative approach outperforms traditional gravity-based methods in terms of effectiveness. We validated the diffusion capacity of the proposed model using the Susceptible-Infected-Recovered (SIR) epidemic model and the Independent Cascade (IC) model, assessing correlation through the Kendall coefficient tau. A comparative analysis with benchmark algorithms highlights the superior performance of the DKBC model. Empirical validation across twelve real-world networks demonstrates the model's exceptional accuracy in identifying key nodes. This study significantly advances the field by illustrating the effectiveness of incorporating spatial information into centrality measures to enhance both network analysis and practical applications.
引用
收藏
页数:19
相关论文
共 41 条
[1]   Efficient algorithms based on centrality measures for identification of top-K influential users in social networks [J].
Alshahrani, Mohammed ;
Zhu Fuxi ;
Sameh, Ahmed ;
Mekouar, Soufiana ;
Sheng Huang .
INFORMATION SCIENCES, 2020, 527 :88-107
[2]   A new local and multidimensional ranking measure to detect spreaders in social networks [J].
Berahmand, Kamal ;
Bouyer, Asgarali ;
Samadi, Negin .
COMPUTING, 2019, 101 (11) :1711-1733
[3]   Identifying influential nodes in complex networks: A node information dimension approach [J].
Bian, Tian ;
Deng, Yong .
CHAOS, 2018, 28 (04)
[4]   Eigenvector-like measures of centrality for asymmetric relations [J].
Bonacich, P ;
Lloyd, P .
SOCIAL NETWORKS, 2001, 23 (03) :191-201
[5]   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
[6]   CENTRALITY IN SOCIAL NETWORKS CONCEPTUAL CLARIFICATION [J].
FREEMAN, LC .
SOCIAL NETWORKS, 1979, 1 (03) :215-239
[7]   The conundrum of functional brain networks: small-world efficiency or fractal modularity [J].
Gallos, Lazaros K. ;
Sigman, Mariano ;
Makse, Hernan A. .
FRONTIERS IN PHYSIOLOGY, 2012, 3
[8]   Immunization of networks with non-overlapping community structure [J].
Ghalmane, Zakariya ;
El Hassouni, Mohammed ;
Cherifi, Hocine .
SOCIAL NETWORK ANALYSIS AND MINING, 2019, 9 (01)
[9]   Identifying multiple influential spreaders in term of the distance-based coloring [J].
Guo, Lei ;
Lin, Jian-Hong ;
Guo, Qiang ;
Liu, Jian-Guo .
PHYSICS LETTERS A, 2016, 380 (7-8) :837-842
[10]   Effects of the distance among multiple spreaders on the spreading [J].
Hu, Z. -L. ;
Liu, J. -G. ;
Yang, G. -Y. ;
Ren, Z. -M. .
EPL, 2014, 106 (01)