RssCell: Calculate the RSS from one node to another.
In dils: Data-Informed Link Strength. Combine multiple-relationship networks into a single weighted network. Impute (fill-in) missing network links.

Description Usage Arguments Details Value Author(s) References See Also Examples

This is a helper function for RelationStrengthSimilarity that returns the RSS for a single directed dyad.

1	RssCell(xadj, v1, v2, radius)

`xadj`	numeric matrix, adjacency matrix where the [i,j] entry gives the strength of the link from node i to node j.
`v1`	numeric, index of the 'from' node.
`v2`	numeric, index of the 'to' node.
`radius`	numeric, length of longest path examined from `v1` to `v2`.

This is an internal function. There are no guardians and it assumes that the adjacency matrix xadj has had zeros entered on the diagonal and then each row divided by the row mean.

numeric, the Relation Strength Similarity score from v1 to v2.

Stephen R. Haptonstahl srh@haptonstahl.org

"Discovering Missing Links in Networks Using Similarity Measures", Hung-Hsuan Chen, Liang Gou, Xiaolong (Luke) Zhang, C. Lee Giles. 2012.

https://github.com/shaptonstahl/

RelationStrengthSimilarity

M <- as.matrix(get.adjacency(graph.atlas(128)))
M
M <- sweep(M, 1, rowMeans(M), "/")
M
dils:::RssCell(xadj=M, v1=5, v2=6, radius=1)
dils:::RssCell(xadj=M, v1=5, v2=6, radius=2)
dils:::RssCell(xadj=M, v1=5, v2=6, radius=3)
dils:::RssCell(xadj=M, v1=5, v2=6, radius=4)