Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality"
Physics and Society
2009-11-11 v2
Abstract
In this comment, we investigate a common used algorithm proposed by Newman [M. E. J. Newman, Phys. Rev. E {\bf 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() time complexity, is given. In addition, the comparison of calculating results for these two algorithm aiming the protein interaction network of Yeast is shown.
Keywords
Cite
@article{arxiv.physics/0511084,
title = {Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality"},
author = {Tao Zhou and Jian-Guo Liu and Bing-Hong Wang},
journal= {arXiv preprint arXiv:physics/0511084},
year = {2009}
}
Comments
3 pages, 2 tables, and 2 figures