graph.diss

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

Model selection for penalized graphical models using the Stability Approach to Regularization Selection ('StARS'), with options for speed-ups including Bounded StARS (B-StARS), batch computing, and other stability metrics (e.g., graphlet stability G-StARS). Christian L. Müller, Richard Bonneau, Zachary Kurtz (2016) <arXiv:1605.07072>.

Zachary Kurtz

pulsar

Parallel Utilities for Lambda Selection along a Regularization
Path

Christian Müller

graph.diss function

<dl><dt>G</dt>
<dd>a \(p*p\) adjacency matrix (dense or sparse) of a graph.</dd>
<dt>sim</dt>
<dd>Flag to return Graph similarity instead (1-dissimilarity)</dd>
<dt>loops</dt>
<dd>Flag to consider self loops</dd></dl>

Arguments

Graph dissimilarity — graph.diss

<dl>

<dt>G</dt>
<dd>a \(p*p\) adjacency matrix (dense or sparse) of a graph.</dd>


<dt>sim</dt>
<dd>Flag to return Graph similarity instead (1-dissimilarity)</dd>


<dt>loops</dt>
<dd>Flag to consider self loops</dd>

</dl>

graph.diss: Graph dissimilarity

Description

Usage

Value

Arguments

References