Identifying influential nodes in complex networks based on resource allocation similarity

被引:2
|
作者
Ai, Jun [1 ]
He, Tao [1 ]
Su, Zhan [1 ]
机构
[1] Univ Shanghai Sci & Technol, Sch Opt Elect & Comp Engn, Shanghai 200093, Peoples R China
关键词
Complex networks; Virtual node; Resource allocation; Node similarity; CENTRALITY; SPREADERS; IDENTIFICATION;
D O I
10.1016/j.physa.2023.129101
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
With the shift in the focus of network science research from macroscopic statistical regularities to microscopic scales, identifying influential nodes in networks has become a commonly discussed and challenging problem in network science. There has been substantial research on identifying the influential nodes, but most methods generally suffer from the incompatibility between time complexity and computational accuracy. This study aims to alleviate the contradiction between time complexity and computa-tional accuracy. Therefore, the novel method based on resource allocation similarity(RAS) is proposed to improve degree centrality by creatively introducing a virtual node and combining it with similarity theory. We simulate the epidemic spreading experiment based on the Susceptible-Infected (SI) model, the static attacking experiment, and the node differentiation experiment on six classical networks. Four typical methods are used to compare with our methods. The experimental results show that, in most cases, the proposed method has a dominant advantage over other comparison methods.(c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] AN IMPROVED PAGERANK FOR IDENTIFYING THE INFLUENTIAL NODES BASED ON RESOURCE ALLOCATION IN DIRECTED NETWORKS
    Zhong, Linfeng
    Lv, Fengmao
    2017 14TH INTERNATIONAL COMPUTER CONFERENCE ON WAVELET ACTIVE MEDIA TECHNOLOGY AND INFORMATION PROCESSING (ICCWAMTIP), 2017, : 42 - 45
  • [2] Identifying influential nodes in complex networks based on AHP
    Bian, Tian
    Hu, Jiantao
    Deng, Yong
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2017, 479 : 422 - 436
  • [3] Identifying influential nodes in complex networks
    Chen, Duanbing
    Lu, Linyuan
    Shang, Ming-Sheng
    Zhang, Yi-Cheng
    Zhou, Tao
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) : 1777 - 1787
  • [4] Identifying influential nodes in complex networks based on expansion factor
    Liu, Dong
    Jing, Yun
    Chang, Baofang
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2016, 27 (09):
  • [5] Identifying influential nodes in complex networks based on spreading probability
    Ai, Jun
    He, Tao
    Su, Zhan
    Shang, Lihui
    CHAOS SOLITONS & FRACTALS, 2022, 164
  • [6] Identifying influential nodes in complex networks based on Neighbours and edges
    Zengzhen Shao
    Shulei Liu
    Yanyu Zhao
    Yanxiu Liu
    Peer-to-Peer Networking and Applications, 2019, 12 : 1528 - 1537
  • [7] Iterative resource allocation based on propagation feature of node for identifying the influential nodes
    Zhong, Lin-Feng
    Liu, Jian-Guo
    Shang, Ming-Sheng
    PHYSICS LETTERS A, 2015, 379 (38) : 2272 - 2276
  • [8] Identifying influential nodes based on graph signal processing in complex networks
    赵佳
    喻莉
    李静茹
    周鹏
    Chinese Physics B, 2015, 24 (05) : 643 - 652
  • [9] Identifying Influential Nodes in Complex Networks Based on Neighborhood Entropy Centrality
    Qiu, Liqing
    Zhang, Jianyi
    Tian, Xiangbo
    Zhang, Shuang
    COMPUTER JOURNAL, 2021, 64 (10): : 1465 - 1476
  • [10] Identifying influential nodes in complex networks based on global and local structure
    Sheng, Jinfang
    Dai, Jinying
    Wang, Bin
    Duan, Guihua
    Long, Jun
    Zhang, Junkai
    Guan, Kerong
    Hu, Sheng
    Chen, Long
    Guan, Wanghao
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2020, 541