nd.edd {NetworkDistance} | R Documentation |
It is of the most simplest form that Edge Difference Distance (EDD) takestwo adjacency matrices and takes Frobenius norm of their differnces.
nd.edd(A, out.dist = TRUE)
A |
a list of length |
out.dist |
a logical; |
a named list containing
an (N\times N)
matrix or dist
object containing pairwise distance measures.
Hammond DK, Gur Y, Johnson CR (2013). “Graph Diffusion Distance: A Difference Measure for Weighted Graphs Based on the Graph Laplacian Exponential Kernel.” In Proceedings of the IEEE global conference on information and signal processing (GlobalSIP'13), 419–422.
## load example data
data(graph20)
## compute distance matrix
output = nd.edd(graph20, out.dist=FALSE)
## visualize
opar <- par(no.readonly=TRUE)
par(pty="s")
image(output$D[,20:1], main="two group case", axes=FALSE, col=gray(0:32/32))
par(opar)