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

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

3 pages, 2 tables, and 2 figures

References in corpus (13)

• Community structure in social and biological networks
• Finding and evaluating community structure in networks
• Lethality and centrality in protein networks
• Universal Behavior of Load Distribution in Scale-free Networks
• Heterogeneity in oscillator networks: Are smaller worlds easier to synchronize?
• Cascade control and defense in complex networks
• Efficient routing on complex networks
• Optimal network topologies for local search with congestion
• Classification of scale-free networks
• Factors that predict better synchronizability on complex networks
• Enhance synchronizability by structural perturbations
• Perturbation: the Catastrophe Causer in Scale-Free Networks
• Better Synchronizability Predicted by Crossed Double Cycle

Cited by in corpus (7)

• Community detection in graphs
• Vital nodes identification in complex networks
• A limited resource model of fault-tolerant capability against cascading failure of complex network
• Scaling behavior of an artificial traffic model on scale-free networks
• Optimal transport on supply-demand networks
• Characterizing cycle structure in complex networks
• Representative Methods of Computational Socioeconomics