graphDist: Inverse of the geodesic distance matrix
In ldstatsHD: Linear Dependence Statistics for High-Dimensional Data

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

graphDist computes the dissimilarity matrix (inverse of geodesic distance) of a graph structure.

1	graphDist(A)

`A`	`matrix` or `Matrix` object with adjacency matrix of a graph.

The geodesic distance between two nodes i and j of a graph is given by the shortest number of edges so that we can go from one of the nodes to the other.

a dissimilarity lower triangular matrix with the inverse of the geodesic distance matrix.

Caballe, Adria <a.caballe@sms.ed.ac.uk>, Natalia Bochkina and Claus Mayer.

Costa, L. and F. Rodrigues (2007). Characterization of complex networks: A survey of measurements. Advances in Physics 56(1), 167-242.

graphCorr for graph correlation matrix.

# example to use of graphDist function
EX1         <- pcorSimulator(nobs = 50, nclusters = 2, nnodesxcluster = c(40,30), 
                             pattern = "powerLaw")
y           <- EX1$y
out3        <- huge(y, method = "mb", lambda = 0.4)
gd          <- graphDist(out3$path[[1]])