View source: R/graphFeatures.R
graph.diss | R Documentation |
Dissimilarity matrix of a graph is here defined as the number of neighbors shared by any two nodes.
graph.diss(G, sim = FALSE, loops = FALSE)
G |
a |
sim |
Flag to return Graph similarity instead (1-dissimilarity) |
loops |
Flag to consider self loops |
a p*p
dissimilarity matrix
Bochkina, N. (2015). Selection of the Regularization Parameter in Graphical Models using a Priori Knowledge of Network Structure, arXiv: 1509.05326.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.