Robustness of centrality measures against network manipulation

被引:25
|
作者
Niu, Qikai [1 ]
Zeng, An [1 ]
Fan, Ying [1 ]
Di, Zengru [1 ]
机构
[1] Beijing Normal Univ, Sch Syst Sci, Beijing 100875, Peoples R China
基金
中国国家自然科学基金;
关键词
Node centrality; Robustness; Network manipulation; COMPLEX; ORGANIZATION; SPREADERS; COMMUNITY;
D O I
10.1016/j.physa.2015.06.031
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Node centrality is an important quantity to consider in studying complex networks as it is related to many applications ranging from the prediction of network structure to the control of dynamics on networks. In the literature, much effort has been devoted to design new centrality measurements. However, the reliability of these centrality measurements has not been fully assessed, particularly with respect to the fact that many real networks are facing different kinds of manipulations such as addition, removal or rewiring of links. In this paper, we focus on the robustness of classic centrality measures against network manipulation. Our analysis is based on both artificial and real networks. We find that the centrality measurements are generally more robust in heterogeneous networks. Biased link manipulation could more seriously distort the centrality measures than random link manipulation. Moreover, the top part of the centrality ranking is more resistant to manipulation. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:124 / 131
页数:8
相关论文
共 50 条
  • [1] The Role of Network Size for the Robustness of Centrality Measures
    Martin, Christoph
    Niemeyer, Peter
    COMPLEX NETWORKS AND THEIR APPLICATIONS VIII, VOL 1, 2020, 881 : 40 - 51
  • [2] On the impact of network size and average degree on the robustness of centrality measures
    Martin, Christoph
    Niemeyer, Peter
    NETWORK SCIENCE, 2021, 9 : S61 - S82
  • [3] On the robustness of centrality measures against link weight quantization in social networks
    Sho Tsugawa
    Yukihiro Matsumoto
    Hiroyuki Ohsaki
    Computational and Mathematical Organization Theory, 2015, 21 : 318 - 339
  • [4] On the robustness of centrality measures against link weight quantization in social networks
    Tsugawa, Sho
    Matsumoto, Yukihiro
    Ohsaki, Hiroyuki
    COMPUTATIONAL AND MATHEMATICAL ORGANIZATION THEORY, 2015, 21 (03) : 318 - 339
  • [5] Robustness of centrality measures under uncertainty: Examining the role of network topology
    Terrill L. Frantz
    Marcelo Cataldo
    Kathleen M. Carley
    Computational and Mathematical Organization Theory, 2009, 15 : 303 - 328
  • [6] Robustness of centrality measures under uncertainty: Examining the role of network topology
    Frantz, Terrill L.
    Cataldo, Marcelo
    Carley, Kathleen M.
    COMPUTATIONAL AND MATHEMATICAL ORGANIZATION THEORY, 2009, 15 (04) : 303 - 328
  • [7] Graph Centrality Measures and the robustness of cooperation
    Li, Menglin
    O'Riordan, Colm
    2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 1232 - 1237
  • [8] Robustness of Centrality Measures Under Incomplete Data
    Meshcheryakova, Natalia
    Shvydun, Sergey
    COMPLEX NETWORKS & THEIR APPLICATIONS XII, VOL 3, COMPLEX NETWORKS 2023, 2024, 1143 : 321 - 331
  • [9] On the Robustness of Centrality Measures against Link Weight Quantization in Real Weighted Social Networks
    Ishino, Masanori
    Tsugawa, Sho
    Ohsaki, Hiroyuki
    2013 IEEE VIRTUAL REALITY CONFERENCE (VR), 2013,
  • [10] Robustness against inefficient manipulation
    Eyal Baharad
    Zvika Neeman
    Social Choice and Welfare, 2007, 29 : 55 - 67