Identifying localized influential spreaders of information spreading

被引:4
|
作者
Liu, Xiang-Chun [1 ,2 ]
Zhu, Xu-Zhen [1 ]
Tian, Hui [1 ]
Zhang, Zeng-Ping [3 ]
Wang, Wei [4 ]
机构
[1] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
[2] Minzu Univ China, Sch Informat Engn, Beijing 100081, Peoples R China
[3] Inner Mongolia Univ Finance & Econ, Sch Comp & Informat Management, Hohhot 010070, Peoples R China
[4] Sichuan Univ, Cybersecur Res Inst, Chengdu 610065, Sichuan, Peoples R China
基金
中国国家自然科学基金;
关键词
Complex networks; Information spreading dynamics; Localized influential spreaders; INFLUENCE MAXIMIZATION; COMPLEX; NODES; IDENTIFICATION; RANKING;
D O I
10.1016/j.physa.2018.11.045
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Identifying the influential spreaders of information spreading dynamics is a hot topic in the field of network science. To identify the influential spreaders, most previous studies were based on the global information of the network. In this paper, we propose a strategy for identifying the influential spreaders from a randomly selected initial-seed node. The seeds are connected as a chain, and are localized to the initial-seed. In our proposed preferentially random walk based influential spreaders identifying strategy, the walker's movement is adjusted by neighbors' degrees. The seeds are those nodes that the walker ever visited. Through extensive numerical simulations on artificial networks and four real-world networks, we find that selecting large degree nodes preferentially is more likely to find the most influential spreaders. The outbreak threshold decreases when preferentially select hubs. Our results shed some light into identifying the most localized influential spreaders. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:92 / 97
页数:6
相关论文
共 50 条
  • [41] A graph exploration method for identifying influential spreaders in complex networks
    Salamanos N.
    Voudigari E.
    Yannakoudakis E.J.
    [J]. Applied Network Science, 2 (1)
  • [42] Identifying influential spreaders in complex networks for disease spread and control
    Xiang Wei
    Junchan Zhao
    Shuai Liu
    Yisi Wang
    [J]. Scientific Reports, 12
  • [43] Discerning Influential Spreaders in Complex Networks by Accounting the Spreading Heterogeneity of the Nodes
    Xin, Yingchu
    Gao, Chao
    Wang, Zhen
    Zhen, Xiyuan
    Li, Xianghua
    [J]. IEEE ACCESS, 2019, 7 : 92070 - 92078
  • [44] Identifying and ranking influential spreaders in complex networks by neighborhood coreness
    Bae, Joonhyun
    Kim, Sangwook
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 395 : 549 - 559
  • [45] Identifying influential spreaders by weight degree centrality in complex networks
    Liu, Yang
    Wei, Bo
    Du, Yuxian
    Xiao, Fuyuan
    Deng, Yong
    [J]. CHAOS SOLITONS & FRACTALS, 2016, 86 : 1 - 7
  • [46] Identifying influential spreaders in complex networks by an improved gravity model
    Zhe Li
    Xinyu Huang
    [J]. Scientific Reports, 11
  • [47] Identifying the influential spreaders in multilayer interactions of online social networks
    Al-Garadi, Mohammed Ali
    Varathan, Kasturi Dewi
    Ravana, Sri Devi
    Ahmed, Ejaz
    Chang, Victor
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2016, 31 (05) : 2721 - 2735
  • [48] Identifying influential spreaders based on diffusion K-truss decomposition
    Yang, Li
    Song, Yu-Rong
    Jiang, Guo-Ping
    Xia, Ling-Ling
    [J]. INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2018, 32 (22):
  • [49] Community-based k -shell decomposition for identifying influential spreaders
    Sun, Peng Gang
    Miao, Qiguang
    Staab, Steffen
    [J]. PATTERN RECOGNITION, 2021, 120
  • [50] An improved weighted LeaderRank algorithm for identifying influential spreaders in complex networks
    Zhang, Zhen-Hao
    Jiang, Guo-Ping
    Song, Yu-Rong
    Xia, Ling-Ling
    Chen, Qi
    [J]. 2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE) AND IEEE/IFIP INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (EUC), VOL 1, 2017, : 748 - 751