wdnc: Weighted Distance to Nearest Center

Description Usage Arguments Details Value Author(s) Examples

Description

Calculates the weighted distance of a node to the nearest center in a network.

Usage

1
wdnc(vnetwork)

Arguments

vnetwork

A valued adjacency matrix. Must be weakly connected.

Details

The WDNC is defined as: WDNC(i)=≤ft(\inf\emph{argmax}_p ∑_{j \in J_p(i)} {\rm llv}(i, j)/d(i, j)\right)-1, J_p(i) is the set of all nodes j which can be reached from vertex i by a path of length p. In words: The WDNC of a vertex i is the neighborhood p in which it gains the maximum EWC minus 1. If the maximum is not unique, infimum chooses the smallest p. The result may be interpreted as a line-weighted distance to the nearest center. The centers are vertices whose WDNC is 0.

Value

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

Author(s)

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

Examples

1
2
vnetwork <- cbind(c(0,2),c(3,0))
wdnc(vnetwork)

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

Related to wdnc in ewc...