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 条
  • [31] A novel method for identifying influential nodes in complex networks based on gravity model
    蒋沅
    杨松青
    严玉为
    童天驰
    代冀阳
    Chinese Physics B, 2022, 31 (05) : 908 - 918
  • [32] 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)
  • [33] A new centrality measure in dense networks based on two-way random walk betweenness
    Curado, Manuel
    Rodriguez, Rocio
    Tortosa, Leandro
    Vicent, Jose F.
    APPLIED MATHEMATICS AND COMPUTATION, 2022, 412
  • [34] Identifying influential risk spreaders in cryptocurrency networks based on the novel gravity strength centrality model
    Wu, Xin
    Lin, Tuo
    Yang, Ming-Yuan
    APPLIED ECONOMICS LETTERS, 2024,
  • [35] 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)
  • [36] 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
  • [37] Heatmap centrality: A new measure to identify super-spreader nodes in scale-free networks
    Duron, Christina
    PLOS ONE, 2020, 15 (07):
  • [38] 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):
  • [39] MNEGC: an improved gravity centrality based on node multi-features and network embedding for identifying influential nodes in complex networks
    Lu, Pengli
    Sun, Lihui
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2025, 2025 (02):
  • [40] Reliable multiplex semi-local random walk based on influential nodes to improve link prediction in complex networks
    Li, Shunlei
    Tang, Jing
    Zhou, Wen
    Zhang, Yin
    Azam, Muhammad Adeel
    Mattos, Leonardo S.
    ARTIFICIAL INTELLIGENCE REVIEW, 2024, 57 (06)