Towards identifying influential nodes in complex networks using semi-local centrality metrics

被引:13
|
作者
Zhang, Kun [1 ]
Zhou, Yu [1 ]
Long, Haixia [1 ]
Wang, Chaoyang [2 ]
Hong, Haizhuang [2 ]
Armaghan, Seyed Mostafa [3 ]
机构
[1] Hainan Normal Univ, Sch Informat Sci & Technol, Haikou 571158, Hainan, Peoples R China
[2] CETC Guohaixintong Technol Hainan Co Ltd, Sansha 570203, Hainan, Peoples R China
[3] Amirkabir Univ Technol, Dept Elect Engn, Tehran, Iran
关键词
Complex networks; Influential nodes; Centrality metrics; Semi-local centrality; Average shortest path; FEEDBACK NONLINEAR-SYSTEMS; ADAPTIVE TRACKING CONTROL;
D O I
10.1016/j.jksuci.2023.101798
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The influence of the node refers to the ability of the node to disseminate information. The faster and wider the node spreads, the greater its influence. There are many classical topological metrics that can be used to evaluate the influencing ability of nodes. Degree centrality, betweenness centrality, closeness centrality and local centrality are among the most common metrics for identifying influential nodes in complex networks. Degree centrality is very simple but not very effective. Global metrics such as betweenness centrality and closeness centrality can better identify influential nodes, but they are not compatible on large-scale networks due to their high complexity. In order to design a ranking method of influential nodes, in this paper a new semi-local centrality metric is proposed based on the relative change in the average shortest path of the entire network. Meanwhile, our metric provides a quantitative global importance model to measure the overall influence of each node. To evaluate the performance of the proposed centrality metric, we use the Susceptible-Infected-Recovered (SIR) epidemic model. Experimental results on several real-world networks show that the proposed metric has competitive performance in identifying influential nodes with existing equivalent centrality metrics and has high efficiency in dealing with large-scale networks. The effectiveness of the proposed metric has been proven with numerical examples and Kendall's coefficient.
引用
收藏
页数:13
相关论文
共 50 条
  • [1] Identifying Influential Nodes in Complex Networks via Semi-Local Centrality
    Dong, Jiali
    Ye, Fanghua
    Chen, Wuhui
    Wu, Jiajing
    2018 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2018,
  • [2] Identifying Influential Nodes in Complex Network Based on Weighted Semi-local Centrality
    Kang, Wenfeng
    Tang, Guangming
    Sun, Yifeng
    Wang, Shuo
    2016 2ND IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATIONS (ICCC), 2016, : 2467 - 2471
  • [3] WSLC: Weighted semi-local centrality to identify influential nodes in complex networks
    Wang, Xiaofeng
    Othman, Marini
    Dewi, Deshinta Arrova
    Wang, Yonghong
    JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2024, 36 (01)
  • [4] Identifying Influential Nodes in Complex Networks From Semi-Local and Global Perspective
    Liu, Wenzhi
    Lu, Pengli
    Zhang, Teng
    IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2024, 11 (02) : 2105 - 2120
  • [5] A novel semi-local centrality to identify influential nodes in complex networks by integrating multidimensional factors
    Zhang, Kun
    Pu, Zaiyi
    Jin, Chuan
    Zhou, Yu
    Wang, Zhenyu
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2025, 145
  • [6] Mining Influential Nodes in Urban Road Networks Based on Semi-local Centrality
    Liu Weiyan
    Liu Bin
    Liu Tao
    2018 10TH INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS (ICCCAS 2018), 2018, : 222 - 226
  • [7] Identifying influential nodes in complex networks: a semi-local centrality measure based on augmented graph and average shortest path theory
    Han-huai, Pan
    Lin-wei, Wang
    Hao, Liu
    Abdollahi, Mohammadjavad
    TELECOMMUNICATION SYSTEMS, 2025, 88 (01)
  • [8] A new semi-local centrality for identifying influential nodes based on local average shortest path with extended neighborhood
    Xiao, Yi
    Chen, Yuan
    Zhang, Hongyan
    Zhu, Xinghui
    Yang, Yimin
    Zhu, Xiaoping
    ARTIFICIAL INTELLIGENCE REVIEW, 2024, 57 (05)
  • [9] LFIC: Identifying Influential Nodes in Complex Networks by Local Fuzzy Information Centrality
    Zhang, Haotian
    Zhong, Shen
    Deng, Yong
    Cheong, Kang Hao
    IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2022, 30 (08) : 3284 - 3296
  • [10] A novel semi local measure of identifying influential nodes in complex networks
    Wang, Xiaojie
    Slamu, Wushour
    Guo, Wenqiang
    Wang, Sixiu
    Ren, Yan
    CHAOS SOLITONS & FRACTALS, 2022, 158