Description Usage Arguments Details Value Author(s) Examples
Minimal directed pathlength between nodes in a network.
1 |
Y |
(matrix) The sociomatrix. Any positive values of |
countdown |
(logical) If true, the progress of the algorithm is printed out. |
The directed distance between nodes of a binary network are computed, making use of the fact that the sociomatrix raised to a given power indicates the existence of paths of a given length between nodes.
A matrix of the same dimension as Y
, giving the distance (minimal
path length) between nodes.
Peter Hoff
1 2 3 4 | data(addhealth3)
Y<-el2sm(addhealth3$E)
netdist(Y)
netdist(Y+t(Y))
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.