Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality"

Details Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality" Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality"

2005-11-09

arxiv.org/abs/physics/0511084v2

Chinese Physics Letters 23, 2327 (2006)

Physics

Physics and Society

3 pages, 2 tables, and 2 figures

Scientific paper

10.1088/0256-307X/23/8/099

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($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.

Affiliated with

Also associated with

No associations

Rating

Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality" does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality", we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comment on ``Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality" will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-386642