Hierarchical Decomposition for Betweenness Centrality Measure of Complex Networks.

ABSTRACT: Betweenness centrality is an indicator of a node's centrality in a network. It is equal to the number of shortest paths from all vertices to all others that pass through that node. Most of real-world large networks display a hierarchical community structure, and their betweenness computation possesses rather high complexity. Here we propose a new hierarchical decomposition approach to speed up the betweenness computation of complex networks. The advantage of this new method is its effective utilization of the local structural information from the hierarchical community. The presented method can significantly speed up the betweenness calculation. This improvement is much more evident in those networks with numerous homogeneous communities. Furthermore, the proposed method features a paralle

SUBMITTER: Li Y 

PROVIDER: S-EPMC5397849 | biostudies-literature | 2017 Apr

REPOSITORIES: biostudies-literature