A novel method to identify influential nodes based on hybrid topology structure

被引:11
|
作者
Wan, Di [1 ]
Yang, Jianxi [1 ]
Zhang, Tingping [1 ]
Xiong, Yuanjun [1 ]
机构
[1] Chongqing Jiaotong Univ, Sch Informat Sci & Engn, Chongqing 400074, Peoples R China
关键词
Rail transit network; Complex network; Influential nodes; Topology of neighbor nodes; Global influence; COMPLEX NETWORKS; RANKING; CENTRALITY;
D O I
10.1016/j.phycom.2023.102046
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
With the increasing popularity of rail transit and the increasing number of light rail trips, the vulnerability of rail transit has become increasingly prominent. Once the rail transit is maliciously broken or the light rail station is repaired, it may lead to large-scale congestion or even the paralysis of the whole rail transit network. Hence, it is particularly important to identify the influential nodes in the rail transit network. Existing identifying methods considered a single scenario on either betweenness centrality (BC) or closeness centrality. In this paper, we propose a hybrid topology structure (HTS) method to identify the critical nodes based on complex network theory. Our proposed method comprehensively considers the topology of the node itself, the topology of neighbor nodes, and the global influence of the node itself. Finally, the susceptible-infected-recovered (SIR) model, the monotonicity (M), the distinct metric (DM), the Jaccard similarity coefficient (JSC), and the Kendall correlation coefficient (KC) are utilized to evaluate the proposed method over the six real-world networks. Experimental results confirm that the proposed method achieves higher performance than existing methods in identifying networks. (c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:7
相关论文
共 50 条
  • [21] A novel method for identifying influential nodes in complex networks based on gravity model
    蒋沅
    杨松青
    严玉为
    童天驰
    代冀阳
    Chinese Physics B, 2022, 31 (05) : 908 - 918
  • [22] A novel method for identifying influential nodes in complex networks based on gravity model
    Jiang, Yuan
    Yang, Song-Qing
    Yan, Yu-Wei
    Tong, Tian-Chi
    Dai, Ji-Yang
    CHINESE PHYSICS B, 2022, 31 (05)
  • [23] A Novel Method to Rank Influential Nodes in Complex Networks Based on Tsallis Entropy
    Chen, Xuegong
    Zhou, Jie
    Liao, Zhifang
    Liu, Shengzong
    Zhang, Yan
    ENTROPY, 2020, 22 (08)
  • [24] A novel measure to identify influential nodes: Return Random Walk Gravity Centrality
    Curado, Manuel
    Tortosa, Leandro
    Vicent, Jose F.
    INFORMATION SCIENCES, 2023, 628 : 177 - 195
  • [25] Embedding model of multilayer networks structure and its application to identify influential nodes
    Lei, Mingli
    Cheong, Kang Hao
    INFORMATION SCIENCES, 2024, 661
  • [26] An improved gravity model to identify influential nodes in complex networks based on k-shell method
    Yang, Xuan
    Xiao, Fuyuan
    KNOWLEDGE-BASED SYSTEMS, 2021, 227 (227)
  • [27] A novel voting measure for identifying influential nodes in complex networks based on local structure
    Li, Haoyang
    Wang, Xing
    Chen, You
    Cheng, Siyi
    Lu, Dejiang
    SCIENTIFIC REPORTS, 2025, 15 (01):
  • [28] Hybrid Global Structure Model for Unraveling Influential Nodes in Complex Networks
    Mukhtar, Mohd Fariduddin
    Abas, Zuraida Abal
    Rasib, Amir Hamzah Abdul
    Anuar, Siti Haryanti Hairol
    Zaki, Nurul Hafizah Mohd
    Rahman, Ahmad Fadzli Nizam Abdul
    Abidin, Zaheera Zainal
    Shibghatullah, Abdul Samad
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2023, 14 (06) : 724 - 730
  • [29] Identify A Group of Influential Nodes in Social Networks Based on Overlapping Community Detection
    Wang, Jing-Dong
    Mu, Qi-Zi
    Gao, Yan-Kun
    Meng, Fan-Qi
    Zhou, Li-Na
    Guo, Shuang
    Journal of Network Intelligence, 2022, 7 (04): : 894 - 908
  • [30] Graph Energy Based Centrality Measure to Identify Influential Nodes in Social Networks
    Kamath, S. S.
    Mahadevi, S.
    2019 IEEE 5TH INTERNATIONAL CONFERENCE FOR CONVERGENCE IN TECHNOLOGY (I2CT), 2019,