Barycenter Centrality


Barycenter Centrality for vertex v defined as:
1 / (total distance from v to all other vertices)

There are 2 types of distance centrality scores – Closeness Centrality and Barycenter Centrality.
Closeness scores are calculated using the formula 1 / (average distance from vertex v to all other vertices) and Barycenter scores are calculated as 1 / (total distance from vertex v to all other vertices).

More central nodes in a connected component will have smaller overall shortest paths, and 'peripheral' nodes on the network will have larger overall shortest paths.
Runing this ranker on a graph with more than one connected component will arbitarily mix nodes from both components. For this reason you should probably run this ranker on one component only.


Require connected and strongly connected network.


  • Viswanath, M., 2009. Ontology-based automatic text summarization (Doctoral dissertation, uga).


There are no comment yet.

Add your comment

Sum of    and