
Distance and Centrality
91
5.3.2 Closeness Centrality
In order to provide a centrality parameter based on global knowledge rather than
local, we may check the easiness of reaching all other nodes from a certain node.
Closeness centrality of a node i in a graph G(V,E) is defined as the reciprocal of the
total distance from this node to all other nodes as shown below:
C
C
(i) =
1
P
j∈V
d(i, j)
(5.10)
We can find distances from a single node to all other nodes of an undirected and
unweighted graph as the number of hops by the BFS algorithm of Section 3.4. A
simple modification to this algorithm to find closeness centralities of nodes would
then be counting of the ...