imp.closeness {streamDAG} | R Documentation |
Calculates improved closeness centrality of individual nodes in a DAG.
imp.closeness(G)
G |
Graph object of class "igraph", see See |
Improved closeness centrality (Beauchamp, 1965) was developed for weakly connected or disconnected digraphs. The measure is based on the reciprocal of nodal shortest path distances from the jth node to the kth node, 1/\delta_{j,k}
. For the jth node this is:
H_j=(n-1) \sum_{j \neq k} 1/\delta_{j,k}
where, for disconnected nodes, the reciprocal distance 1/\infty
is taken to be zero.
Improved closeness centrality of a node
Ken Aho, Gabor Csardi wrote distances
Beauchamp, M. A. (1965). An improved index of centrality. Behavioral Science, 10(2), 161-163.
network_a <- graph_from_literal(a --+ b, c --+ d, d --+ e, b --+ e,
e --+ j, j --+ m, f --+ g, g --+ i, h --+ i, i --+ k, k --+ l,
l --+ m, m --+ n, n --+ o)
imp.closeness(network_a)