Calculate edge-weighted closeness, a weighted version of closeness(sna).
A valued adjacency matrix. Must be weakly connected.
The EWC is defined as:
llv(i,j) is the average last line value on the path from node i to node j,
d(i,j) is the distance from i to j and
\max(lv) is the maximum of all line values in
A vector of length
dim(vnetwork) containing the EWC values.
Angela Bohn angela.bohn at gmail.com and Norbert Walchhofer
Angela Bohn, Norbert Walchhofer, Patrick Mair and Kurt Hornik. Social Network Analysis of Weighted Telecommunications Graphs. 2009. Research Report Series 84, Department of Statistics and Mathematics, Vienna University of Economics and Business.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.