GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks

被引:7
|
作者
Tu, Dengqin [1 ]
Xu, Guiqiong [1 ]
Meng, Lei [1 ]
机构
[1] Shanghai Univ, Sch Management, Dept Informat Management, Shanghai 200444, Peoples R China
来源
基金
上海市科技启明星计划;
关键词
Complex networks; influential nodes; gravity model; spreading capability; centrality; SPREADERS; CENTRALITY; IDENTIFICATION;
D O I
10.1142/S0217979221501836
中图分类号
O59 [应用物理学];
学科分类号
摘要
The identification of influential nodes is one of the most significant and challenging research issues in network science. Many centrality indices have been established starting from topological features of networks. In this work, we propose a novel gravity model based on position and neighborhood (GPN), in which the mass of focal and neighbor nodes is redefined by the extended outspreading capability and modified k-shell iteration index, respectively. This new model comprehensively considers the position, local and path information of nodes to identify influential nodes. To test the effectiveness of GPN, a number of simulation experiments on nine real networks have been conducted with the aid of the susceptible-infected-recovered (SIR) model. The results indicate that GPN has better performance than seven popular methods. Furthermore, the proposed method has near linear time cost and thus it is suitable for large-scale networks.
引用
下载
收藏
页数:17
相关论文
共 50 条
  • [31] 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
  • [32] An improved gravity model for identifying influential nodes in complex networks considering asymmetric attraction effect
    Meng, Lei
    Xu, Guiqiong
    Dong, Chen
    Physica A: Statistical Mechanics and its Applications, 2025, 657
  • [33] A Novel Model to Identify the Influential Nodes: Evidence Theory Centrality
    Zhao, Jie
    Song, Yutong
    Deng, Yong
    IEEE ACCESS, 2020, 8 : 46773 - 46780
  • [34] A novel method for identifying influential nodes in complex networks based on multiple attributes
    Liu, Dong
    Nie, Hao
    Zhang, Baowen
    INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2018, 32 (28):
  • [35] A novel method of identifying influential nodes in complex networks based on random walks
    Zhang, Tingping
    Liang, Xinyu
    Journal of Information and Computational Science, 2014, 11 (18): : 6735 - 6740
  • [36] 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)
  • [37] Finding Influential Nodes in Complex Networks Using Nearest Neighborhood Trust Value
    Hajarathaiah, Koduru
    Enduri, Murali Krishna
    Anamalamudi, Satish
    COMPLEX NETWORKS & THEIR APPLICATIONS X, VOL 2, 2022, 1016 : 253 - 264
  • [38] Identify influential nodes in complex networks: A k-orders entropy-based method
    Wu, Yali
    Dong, Ang
    Ren, Yuanguang
    Jiang, Qiaoyong
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2023, 632
  • [39] Finding influential nodes in social networks based on neighborhood correlation coefficient
    Zareie, Ahmad
    Sheikhahmadi, Amir
    Jalili, Mahdi
    Fasaei, Mohammad Sajjad Khaksar
    KNOWLEDGE-BASED SYSTEMS, 2020, 194 (194)
  • [40] 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