Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality"
Tao Zhou, Jian-Guo Liu, Bing-Hong Wang
Abstract
In this comment, we investigate a common used algorithm proposed by Newman [M. E. J. Newman, Phys. Rev. E 64, 016132(2001)] to calculate the betweenness centrality for all vertices. The inaccurateness of Newman's algorithm is pointed out and a corrected algorithm, also with O(MN) time complexity, is given. In addition, the comparison of calculating results for these two algorithm aiming the protein interaction network of Yeast is shown.
Create a lesson
Related papers
Distinct routes to phase transitions in spatial activation systems
Jialu Zhang, Guanyu Zhang, Leyang Xue et al.
District-Level Food Environment Indicators and Social Vulnerability in São Paulo
Pedro Lemes Sixel Lobo, Eric Tokuda, Kuruvilla Joseph Abraham et al.
Prompt Sensitivity of Generative Agents: Evidence from an Epidemic Model
Ross Williams, Niyousha Hosseinichimeh
Giant strongly biconnected components of directed networks: a generating function approach
Minsoo Yang, Reinhard Laubenbacher, Byungjoon Min
(k,n)-core percolation on hypergraphs with anchor nodes
Hoseung Jang, Byungjoon Min, Ginestra Bianconi
The complex relationship between anti-immigrant sentiment and exposure in the Netherlands
Benedikt Meylahn, Tommaso Giommoni, Mike Lees et al.