ewc: Edge-Weighted Closeness

Description Usage Arguments Details Value Author(s) References Examples

Description

Calculate edge-weighted closeness, a weighted version of closeness(sna).

Usage

1
ewc(vnetwork)

Arguments

vnetwork

A valued adjacency matrix. Must be weakly connected.

Details

The EWC is defined as: EWC(i)=\frac{∑_{j}{\frac{llv(i,j)}{d(i,j)}}}{\max(lv)(n-1)}, where 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 vnetwork.

Value

A vector of length dim(vnetwork)[1] containing the EWC values.

Author(s)

Angela Bohn angela.bohn at gmail.com and Norbert Walchhofer

References

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.

Examples

1
2
vnetwork <- rbind(c(0,2),c(3,0))
ewc(vnetwork)

ewc documentation built on May 2, 2019, 5:50 p.m.

Related to ewc in ewc...