rsbm

<code>rsbm</code> returns the adjacency matrix and the cluster labels generated randomly with a Stochastic Block Model.

An ensemble of algorithms that enable the clustering of networks and data matrices (such as counts, categorical or continuous) with different type of generative models. Model selection and clustering is performed in combination by optimizing the Integrated Classification Likelihood (which is equivalent to minimizing the description length). Several models are available such as: Stochastic Block Model, degree corrected Stochastic Block Model, Mixtures of Multinomial, Latent Block Model. The optimization is performed thanks to a combination of greedy local search and a genetic algorithm (see <arXiv:2002:11577> for more details).

Etienne C<c3><b4>me

greed

Clustering and Model Selection with the Integrated
Classification Likelihood

Etienne Côme

Nicolas Jouvin

rsbm function

<dl><dt>N</dt>
<dd>The size of the graph to generate</dd>
<dt>pi</dt>
<dd>A numeric vector of length K with clusters proportions (will be normalized to sum up to 1).</dd>
<dt>mu</dt>
<dd>A numeric matrix of dim K x K with the connectivity pattern to generate. elements in [0,1].</dd></dl>

Arguments

Generate a graph adjacency matrix using a Stochastic Block Model — rsbm

<dl>

<dt>N</dt>
<dd>The size of the graph to generate</dd>


<dt>pi</dt>
<dd>A numeric vector of length K with clusters proportions (will be normalized to sum up to 1).</dd>


<dt>mu</dt>
<dd>A numeric matrix of dim K x K with the connectivity pattern to generate. elements in [0,1].</dd>

</dl>

rsbm: Generate a graph adjacency matrix using a Stochastic Block Model

Description

Usage

Value

Arguments

Details

Examples