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 条
  • [41] 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)
  • [42] Learning to Identify High Betweenness Centrality Nodes from Scratch: A Novel Graph Neural Network Approach
    Fan, Changjun
    Zeng, Li
    Ding, Yuhui
    Chen, Muhao
    Sun, Yizhou
    Liu, Zhong
    PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19), 2019, : 559 - 568
  • [43] Integrating random walk and binary regression to identify novel miRNA-disease association
    Niu, Ya-Wei
    Wang, Guang-Hui
    Yan, Gui-Ying
    Chen, Xing
    BMC BIOINFORMATICS, 2019, 20 (1)
  • [44] Integrating random walk and binary regression to identify novel miRNA-disease association
    Ya-Wei Niu
    Guang-Hui Wang
    Gui-Ying Yan
    Xing Chen
    BMC Bioinformatics, 20
  • [45] Integrating random walk with restart and k-Nearest Neighbor to identify novel circRNA-disease association
    Xiujuan Lei
    Chen Bian
    Scientific Reports, 10
  • [46] Integrating random walk with restart and k-Nearest Neighbor to identify novel circRNA-disease association
    Lei, Xiujuan
    Bian, Chen
    SCIENTIFIC REPORTS, 2020, 10 (01)
  • [47] A network-based method using a random walk with restart algorithm and screening tests to identify novel genes associated with Meniere's disease
    Li, Lin
    Wang, YanShu
    An, Lifeng
    Kong, XiangYin
    Huang, Tao
    PLOS ONE, 2017, 12 (08):