relabel

Takes a vector of vertex ids indicating community membership, and relabels the communities
to have consecutive values from 1 to the number of communities.

Evaluates the stability and significance of clusters on 'igraph' graphs.
Supports weighted and unweighted graphs. Implements the cluster evaluation methods
defined by Arratia A, Renedo M (2021) <doi:10.7717/peerj-cs.600>. Also includes an
implementation of the Reduced Mutual Information introduced by Newman et al. (2020)
<doi:10.1103/PhysRevE.101.042304>.

Martc3<ad> Mirambell

clustAnalytics

Cluster Evaluation on Graphs

relabel function

<dl><dt>c</dt>
<dd>numeric vector of vertex ids, not necessarily consecutive</dd></dl>

Arguments

Relabels membership vector — relabel

<dl>

<dt>c</dt>
<dd>numeric vector of vertex ids, not necessarily consecutive</dd>

</dl>

relabel: Relabels membership vector

Description

Usage

Value

Arguments