Closeness: Difference between revisions
Jump to navigation
Jump to search
(basic definition of closeness) |
No edit summary |
||
Line 1: | Line 1: | ||
'''Closeness''' is | '''Closeness''' is a radial measure of centrality that favors actors who are connected with many others via short paths. | ||
The raw closeness score of a node <math>v</math> is defined as the reciprocal of its total distance to those it can reach via directed paths, | |||
<math>c_C(v)=\frac{\text{number of reachable nodes}}{\sum\limits_{\text{reachable nodes } t} d_G(v,t)}</math> | |||
where <math>d_G(v,t)</math> denotes the length of a shortest directed path from <math>v</math> to <math>t</math>. | |||
If a [[link strength]] has been selected, the length of an <math>(v,t)</math>-path is the sum of the corresponding attribute values of all links in the path. |
Revision as of 18:11, 17 January 2011
Closeness is a radial measure of centrality that favors actors who are connected with many others via short paths.
The raw closeness score of a node is defined as the reciprocal of its total distance to those it can reach via directed paths,
where denotes the length of a shortest directed path from to . If a link strength has been selected, the length of an -path is the sum of the corresponding attribute values of all links in the path.