In a connected graph, closeness centrality of a node is a measure of centrality in a network, calculated as the reciprocal of the sum of the length of the shortest paths between the node and all other nodes in the graph. Thus, the more central a node is, the closer it is to all other nodes. Closeness was defined by Bavelas as the reciprocal of the farness, that is: where is the distance between vertices and. When speaking of closeness centrality, people usually refer to its normalized form which represents the average length of the shortest paths instead of their sum. It is generally given by the previous formula multiplied by, where is the number of nodes in the graph. For large graphs this difference becomes inconsequential so the is dropped resulting in: This adjustment allows comparisons between nodes of graphs of different sizes. Taking distances from or to all other nodes is irrelevant in undirected graphs, whereas it can produce totally different results in directed graphs.
In disconnected graphs
When a graph is not strongly connected, a widespread idea is that of using the sum of reciprocal of distances, instead of the reciprocal of the sum of distances, with the convention : The most natural modification of Bavelas's definition of closeness is following the general principle proposed by Marchiori and Latora that in graphs with infinite distances the harmonic mean behaves better than the arithmetic mean. Indeed, Bavelas's closeness can be described as the denormalized reciprocal of the arithmetic mean of distances, whereas harmonic centrality is the denormalized reciprocal of the harmonic mean of distances. This idea was explicitly stated for undirected graphs under the name valued centrality by Dekker and under the name harmonic centrality by Rochat, axiomatized by Garg and proposed once again later by Opsahl. It was studied on general directed graphs by Boldi and Vigna. This idea is also quite similar to market potential proposed in Harris which now often goes by the term market access.
Variants
Dangalchev, in a work on network vulnerability proposes for undirected graphs a different definition: This definition is used effectively for disconnected graphs and allows to create convenient formulae for graph operations. For example: If a graph is created by linking node of graph to node of graph then the combined closeness is: If graph is the thorn graph of graph, which has nodes, then closeness is : The natural generalization of this definition is where belongs to. As increases from 0 to 1, the generalized closeness changes from local characteristic to global. The information centrality of Stephenson and Zelen is another closeness measure, which computes the harmonic mean of the resistance distances towards a vertexx, which is smaller if x has many paths of small resistance connecting it to other vertices. In the classic definition of the closeness centrality, the spread of information is modeled by the use of shortest paths. This model might not be the most realistic for all types of communication scenarios. Thus, related definitions have been discussed to measure closeness, like the random walk closeness centrality introduced by Noh and Rieger. It measures the speed with which randomly walking messages reach a vertex from elsewhere in the graph—a sort of random-walk version of closeness centrality. Hierarchical closeness of Tran and Kwon is an extended closeness centrality to deal still in another way with the limitation of closeness in graphs that are not strongly connected. The hierarchical closeness explicitly includes information about the range of other nodes that can be affected by the given node.
