Identifying influential nodes on directed networks

被引:1
作者
Lee, Yan-Li [1 ]
Wen, Yi-Fei [1 ]
Xie, Wen -Bo [2 ]
Pan, Liming [3 ]
Du, Yajun [1 ]
Zhou, Tao [4 ]
机构
[1] Xihua Univ, Sch Comp & Software Engn, Chengdu 610039, Peoples R China
[2] Southwest Petr Univ, Sch Comp Sci, Chengdu 610500, Peoples R China
[3] Univ Sci & Technol China, Sch Cyber Sci & Technol, Hefei 230026, Peoples R China
[4] Univ Elect Sci & Technol China, CompleX Lab, Chengdu 611731, Peoples R China
基金
中国国家自然科学基金;
关键词
Complex networks; Influential nodes; Directed networks; COMPLEX NETWORKS; IDENTIFICATION; RANKING;
D O I
10.1016/j.ins.2024.120945
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Identifying influential nodes on directed networks is a challenging and widely studied task that keeps drawing extensive attention from both academia and industry. The simultaneous consideration of both local and global structural information has demonstrated its effectiveness in identifying influential nodes on un-directed networks. Nevertheless, how to better utilize these two types of information on directed networks remains a challenge. In this paper, we address the influential nodes identification problem for directed networks where a node can directly affect its in -neighbors, like the social network of Twitter. We present a general iterative framework that integrates both local structural information and global influence. The global influence exerted by the target node is determined as the cumulative sum of the global influences originating from its in -neighbors, achieved through an iterative procedure. Meanwhile, the in -degree of the target node is leveraged to capture local structural information, which is consistently reinforced throughout the iterative process to prevent the attenuation of its significance over successive iterations. Our algorithm demonstrates significant performance improvement, averaging 21.61% in Kendall's tau and 23.43% in precision@0.05 over the 8 benchmarks across 15 real networks. Moreover, it outperforms the benchmarks on artificial networks, and can effectively identify fast influencers.
引用
收藏
页数:15
相关论文
共 50 条
  • [1] ANDERSON R M, 1991
  • [2] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [3] Network science
    Barabasi, Albert-Laszlo
    [J]. PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2013, 371 (1987):
  • [4] Batagelj V., 2009, PAJEK DATASETS
  • [5] Eigenvector-like measures of centrality for asymmetric relations
    Bonacich, P
    Lloyd, P
    [J]. SOCIAL NETWORKS, 2001, 23 (03) : 191 - 201
  • [6] The anatomy of a large-scale hypertextual Web search engine
    Brin, S
    Page, L
    [J]. COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7): : 107 - 117
  • [7] Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering
    Chen, Duan-Bing
    Gao, Hui
    Lu, Linyuan
    Zhou, Tao
    [J]. PLOS ONE, 2013, 8 (10):
  • [8] Identifying influential nodes in complex networks
    Chen, Duanbing
    Lu, Linyuan
    Shang, Ming-Sheng
    Zhang, Yi-Cheng
    Zhou, Tao
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) : 1777 - 1787
  • [9] A novel measure to identify influential nodes: Return Random Walk Gravity Centrality
    Curado, Manuel
    Tortosa, Leandro
    Vicent, Jose F.
    [J]. INFORMATION SCIENCES, 2023, 628 : 177 - 195
  • [10] Characterizing cycle structure in complex networks
    Fan, Tianlong
    Lu, Linyuan
    Shi, Dinghua
    Zhou, Tao
    [J]. COMMUNICATIONS PHYSICS, 2021, 4 (01)