graph.diss {pulsar}

Graph dissimilarity

Description

Dissimilarity matrix of a graph is here defined as the number of neighbors shared by any two nodes.

Usage

graph.diss(G, sim = FALSE, loops = FALSE)

Arguments

G

a p*p adjacency matrix (dense or sparse) of a graph.

sim

Flag to return Graph similarity instead (1-dissimilarity)

loops

Flag to consider self loops

Value

a p*p dissimilarity matrix

References

Bochkina, N. (2015). Selection of the Regularization Parameter in Graphical Models using a Priori Knowledge of Network Structure, arXiv: 1509.05326.