Effect of variable network clustering on the accuracy of node centrality

被引:6
|
作者
Song Yu-Ping [1 ]
Ni Jing [1 ]
机构
[1] Univ Shanghai Sci & Technol, Sch Business, Shanghai 200093, Peoples R China
基金
上海市自然科学基金;
关键词
network science; node centrality; network structure; clustering coefficient; IDENTIFYING INFLUENTIAL NODES; RANKING SPREADERS; COMPLEX NETWORK; IDENTIFICATION; BEHAVIOR;
D O I
10.7498/aps.65.028901
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Measurements of node centrality are based on characterizing the network topology structure in a certain perspective. Changing the network topology structure would affect the accuracy of the measurements. In this paper, we employ the Holme-Kim model to construct scale-free networks with tunable clustering, and consider the four measurements of classical centrality, including degree centrality, closeness centrality, betweenness centrality and the eigenvector centrality. For comparing the accuracy of the four centrality measurements, we simulate the susceptible-infected-recovered spreading of the tunable clustering scale free networks. Experimental results show that the degree centrality and the betweenness centrality are more accurate in networks with lower clustering, while the eigenvector centrality performs well in high clustering networks, and the accuracy of the closeness centrality keeps stable in networks with variable clustering. In addition, the accuracy of the degree centrality and the betweenness centrality are more reliable in the spreading process at the high infectious rates than that of the eigenvector centrality and the closeness centrality. Furthermore, we also use the reconnected autonomous system networks to validate the performance of the four classical centrality measurements with varying cluster. Results show that the accuracy of the degree centrality declines slowly when the clustering of real reconnected networks increases from 0.3 to 0.6, and the accuracy of the closeness centrality has a tiny fluctuation when the clustering of real reconnected networks varies. The betweenness centrality is more accurate in networks with lower clustering, while the eigenvector centrality performs well in high clustering networks, which is the same as in the tunable clustering scale free networks. According to the spreading experiments in the artificial and real networks, we conclude that the network clustering structure affects the accuracy of the node centrality, and suggest that when evaluating the node influence, we can choose the degree centrality in the low clustering networks, while the eigenvector centrality and the closeness centrality are still in the high clustering networks. When considering the spreading dynamics, the accuracy of the eigenvector centrality and the closeness centrality is high, but the accuracy of the degree centrality and the betweenness centrality is more reliable in the spreading process at high infectious rates. This work would be helpful for deeply understanding of the node centrality measurements in complex networks.
引用
收藏
页数:8
相关论文
共 42 条
  • [1] Statistical mechanics of complex networks
    Albert, R
    Barabási, AL
    [J]. REVIEWS OF MODERN PHYSICS, 2002, 74 (01) : 47 - 97
  • [2] [Anonymous], PLOS ONE
  • [3] Identifying Influential and Susceptible Members of Social Networks
    Aral, Sinan
    Walker, Dylan
    [J]. SCIENCE, 2012, 337 (6092) : 337 - 341
  • [4] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [5] A 61-million-person experiment in social influence and political mobilization
    Bond, Robert M.
    Fariss, Christopher J.
    Jones, Jason J.
    Kramer, Adamd. I.
    Marlow, Cameron
    Settle, Jaime E.
    Fowler, James H.
    [J]. NATURE, 2012, 489 (7415) : 295 - 298
  • [6] Centrality and network flow
    Borgatti, SP
    [J]. SOCIAL NETWORKS, 2005, 27 (01) : 55 - 71
  • [7] The Spread of Behavior in an Online Social Network Experiment
    Centola, Damon
    [J]. SCIENCE, 2010, 329 (5996) : 1194 - 1197
  • [8] Path diversity improves the identification of influential spreaders
    Chen, Duan-Bing
    Xiao, Rui
    Zeng, An
    Zhang, Yi-Cheng
    [J]. EPL, 2013, 104 (06)
  • [9] 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
  • [10] Identifying the starting point of a spreading process in complex networks
    Comin, Cesar Henrique
    Costa, Luciano da Fontoura
    [J]. PHYSICAL REVIEW E, 2011, 84 (05)