A novel measure to identify influential nodes: Return Random Walk Gravity Centrality

被引:35
|
作者
Curado, Manuel [1 ]
Tortosa, Leandro [2 ]
Vicent, Jose F. [2 ]
机构
[1] Catholic Univ Murcia, Polytech Sch, Campus Jeronimos S-N, Murcia 30107, Spain
[2] Univ Alicante, Dept Comp Sci & Artificial Intelligence, Campus San Vicente,Ap Correos 99, Alicante 03080, Spain
关键词
Centrality measure; Effective distance; Random paths; Densification; Gravity model; COMMUNITY STRUCTURE; COMPLEX NETWORKS; INFORMATION;
D O I
10.1016/j.ins.2023.01.097
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To identify influential nodes in real networks, it is essential to note the importance of considering the local and global information in a network. In addition, it is also key to consider the dynamic information. Accordingly, the main aim of this paper is to present a new centrality measure based on return random walk and the effective distance gravity model (C-RRWG). This new metric in-creases the relevance of nodes with a dual role: i) at the local level, they are important in their community or cluster, and ii) at the global level, they give cohesion to the network. It has advantages over other traditional models of centrality since it considers the global and local information, as well as the information of the dynamic interaction between the nodes, as recent studies on community-aware centrality measures demonstrate. Thus, the combination of dynamic and static information makes it easier to detect influential nodes in complex networks. To validate the effectiveness of the proposed centrality measure, it is compared with classic measures, such as Degree, Closeness, Betweenness, PageRank, and other measures based on the gravity model, effective distance and community-aware approaches. The experimental results show the effectiveness of C-RRWG through a set of experiments on different types of networks.
引用
收藏
页码:177 / 195
页数:19
相关论文
共 47 条
  • [1] Influential Yield Strength of Steel Materials with Return Random Walk Gravity Centrality
    Rodriguez, Rocio
    Curado, Manuel
    Rodriguez, Francy D.
    Vicent, Jose F.
    MATHEMATICS, 2024, 12 (03)
  • [2] A novel method to identify influential nodes in complex networks based on gravity centrality
    Zhang, Qinyu
    Shuai, Bin
    Lu, Min
    INFORMATION SCIENCES, 2022, 618 : 98 - 117
  • [3] The random walk-based gravity model to identify influential nodes in complex networks
    Zhao, Jie
    Wen, Tao
    Jahanshahi, Hadi
    Cheong, Kang Hao
    INFORMATION SCIENCES, 2022, 609 : 1706 - 1720
  • [4] A Novel Model to Identify the Influential Nodes: Evidence Theory Centrality
    Zhao, Jie
    Song, Yutong
    Deng, Yong
    IEEE ACCESS, 2020, 8 : 46773 - 46780
  • [5] 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,
  • [6] A new measure of identifying influential nodes: Efficiency centrality
    Wang, Shasha
    Du, Yuxian
    Deng, Yong
    COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2017, 47 : 151 - 163
  • [7] A modified efficiency centrality to identify influential nodes in weighted networks
    Yunchuan Wang
    Shasha Wang
    Yong Deng
    Pramana, 2019, 92
  • [8] A novel centrality measure for identifying influential nodes based on minimum weighted degree decomposition
    Lu, Pengli
    Zhang, Zhiru
    Guo, Yuhong
    Chen, Yahong
    INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2021, 35 (24):
  • [9] A modified efficiency centrality to identify influential nodes in weighted networks
    Wang, Yunchuan
    Wang, Shasha
    Deng, Yong
    PRAMANA-JOURNAL OF PHYSICS, 2019, 92 (04):
  • [10] A new Centrality Measure for Identifying Influential Nodes in Social Networks
    Rhouma, Delel
    Ben Romdhane, Lotfi
    TENTH INTERNATIONAL CONFERENCE ON MACHINE VISION (ICMV 2017), 2018, 10696