Description Usage Arguments Value References Examples
Hamming Distance is the count of discrepancy between two binary networks for each edge. Therefore, if used with non-binary networks, it might return a warning message and distorted results. It was originally designed to compare two strings of equal length, see Wikipedia page for more detailed introduction.
1 | nd.hamming(A, out.dist = TRUE)
|
A |
a list of length N containing adjacency matrices. |
out.dist |
a logical; |
a named list containing
an (N\times N) matrix or dist
object containing pairwise distance measures.
hamming_error_1950NetworkDistance
1 2 3 4 5 6 7 8 9 10 11 12 | ## load example data and extract only a few
data(graph20)
gr.small = graph20[c(1:5,11:15)]
## compute distance matrix
output = nd.hamming(gr.small, out.dist=FALSE)
## visualize
opar = par(no.readonly=TRUE)
par(pty="s")
image(output$D[,10:1], main="two group case", axes=FALSE, col=gray(0:32/32))
par(opar)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.