natural.connectivity

Compute the natural connectivity of a graph

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

natural.connectivity function

<dl><dt>G</dt>
<dd>a \(p*p\) adjacency matrix (dense or sparse) of a graph. Ignored if <code>eig</code> is given</dd>
<dt>eig</dt>
<dd>precomputed list of eigen vals/vectors (output from <code>eigen</code>). If NULL, compute for <code>G</code>.</dd>
<dt>norm</dt>
<dd>should the natural connectivity score be normalized</dd></dl>

Arguments

Natural Connectivity — natural.connectivity

<dl>

<dt>G</dt>
<dd>a \(p*p\) adjacency matrix (dense or sparse) of a graph. Ignored if <code>eig</code> is given</dd>


<dt>eig</dt>
<dd>precomputed list of eigen vals/vectors (output from <code>eigen</code>). If NULL, compute for <code>G</code>.</dd>


<dt>norm</dt>
<dd>should the natural connectivity score be normalized</dd>

</dl>

natural.connectivity: Natural Connectivity

Description

Usage

Value

Arguments

Details

References