Role of centrality for the identification of influential spreaders in complex networks

被引:105
|
作者
de Arruda, Guilherme Ferraz [1 ]
Barbieri, Andre Luiz [1 ]
Rodriguez, Pablo Martin [1 ]
Rodrigues, Francisco A. [1 ]
Moreno, Yamir [2 ,3 ,4 ]
Costa, Luciano da Fontoura [5 ]
机构
[1] Univ Sao Paulo, Inst Ciencias Mat & Comp, Dept Matemat Aplicada & Estat, BR-13560970 Sao Carlos, SP, Brazil
[2] Univ Zaragoza, Inst Biocomputat & Phys Complex Syst BIFI, Zaragoza 50018, Spain
[3] Univ Zaragoza, Dept Theoret Phys, Zaragoza 50018, Spain
[4] Inst Sci Interchange, Complex Networks & Syst Lagrange Lab, Turin, Italy
[5] Univ Sao Paulo, Inst Fis Sao Carlos, BR-13560970 Sao Carlos, SP, Brazil
基金
巴西圣保罗研究基金会;
关键词
SCALE-FREE; PHYSICS;
D O I
10.1103/PhysRevE.90.032812
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
The identification of the most influential spreaders in networks is important to control and understand the spreading capabilities of the system as well as to ensure an efficient information diffusion such as in rumorlike dynamics. Recent works have suggested that the identification of influential spreaders is not independent of the dynamics being studied. For instance, the key disease spreaders might not necessarily be so important when it comes to analyzing social contagion or rumor propagation. Additionally, it has been shown that different metrics (degree, coreness, etc.) might identify different influential nodes even for the same dynamical processes with diverse degrees of accuracy. In this paper, we investigate how nine centrality measures correlate with the disease and rumor spreading capabilities of the nodes in different synthetic and real-world (both spatial and nonspatial) networks. We also propose a generalization of the random walk accessibility as a new centrality measure and derive analytical expressions for the latter measure for simple network configurations. Our results show that for nonspatial networks, the k-core and degree centralities are the most correlated to epidemic spreading, whereas the average neighborhood degree, the closeness centrality, and accessibility are the most related to rumor dynamics. On the contrary, for spatial networks, the accessibility measure outperforms the rest of the centrality metrics in almost all cases regardless of the kind of dynamics considered. Therefore, an important consequence of our analysis is that previous studies performed in synthetic random networks cannot be generalized to the case of spatial networks.
引用
收藏
页数:17
相关论文
共 50 条
  • [41] Identifying influential spreaders in complex networks by propagation probability dynamics
    Chen, Duan-Bing
    Sun, Hong-Liang
    Tang, Qing
    Tian, Sheng-Zhao
    Xie, Mei
    CHAOS, 2019, 29 (03)
  • [42] Identify influential spreaders in complex real-world networks
    Liu, Ying
    Tang, Ming
    Yue, Jing
    Gong, Jie
    IEEE 12TH INT CONF UBIQUITOUS INTELLIGENCE & COMP/IEEE 12TH INT CONF ADV & TRUSTED COMP/IEEE 15TH INT CONF SCALABLE COMP & COMMUN/IEEE INT CONF CLOUD & BIG DATA COMP/IEEE INT CONF INTERNET PEOPLE AND ASSOCIATED SYMPOSIA/WORKSHOPS, 2015, : 1144 - 1148
  • [43] Identifying influential spreaders in complex networks for disease spread and control
    Wei, Xiang
    Zhao, Junchan
    Liu, Shuai
    Wang, Yisi
    SCIENTIFIC REPORTS, 2022, 12 (01)
  • [44] New metrics for influential spreaders identification in complex networks based on D-spectra of nodes
    Chen, Ricky X. F.
    Liu, Xin-Yu
    PHYSICS LETTERS A, 2024, 526
  • [45] Identifying and ranking influential spreaders in complex networks by neighborhood coreness
    Bae, Joonhyun
    Kim, Sangwook
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 395 : 549 - 559
  • [46] Identifying influential spreaders in complex networks by an improved gravity model
    Zhe Li
    Xinyu Huang
    Scientific Reports, 11
  • [47] Logarithmic Gravity Centrality for Identifying Influential Spreaders in Dynamic Large-scale Social Networks
    Niu, Jianwei
    Yang, Haifeng
    Wang, Lei
    2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2017,
  • [48] A sequential-path tree-based centrality for identifying influential spreaders in temporal networks
    Tao, Li
    Kong, Shengzhou
    He, Langzhou
    Zhang, Fan
    Li, Xianghua
    Jia, Tao
    Han, Zhen
    CHAOS SOLITONS & FRACTALS, 2022, 165
  • [49] Identifying multiple influential spreaders based on generalized closeness centrality
    Liu, Huan-Li
    Ma, Chuang
    Xiang, Bing-Bing
    Tang, Ming
    Zhang, Hai-Feng
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2018, 492 : 2237 - 2248
  • [50] Identifying Influential Spreaders by Temporal Efficiency Centrality in Temporal Network
    Xue, Kai
    Wang, Junyi
    CLOUD COMPUTING AND SECURITY, PT V, 2018, 11067 : 369 - 383