normalized_cut

Normalized cut of a graph's communities, which is given by
$$\frac{c_s}{2m_s+c_s}+\frac{c_s}{2(m-m_s)+c_s}$$,
where $c_s$ is the weight of the edges connecting the community s to the rest
of the graph, $m_s$ is the internal weight of the community, and $m$ is
the total weight of the network.

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

normalized_cut function

<dl><dt>g</dt>
<dd>Graph to be analyzed (as an <code>igraph</code> object). If the edges have a "weight"
attribute, those will be used as weights.</dd>
<dt>com</dt>
<dd>community membership integer vector. Each element corresponds to a vertex.</dd></dl>

Arguments

Normalized cut — normalized_cut

<dl>

<dt>g</dt>
<dd>Graph to be analyzed (as an <code>igraph</code> object). If the edges have a "weight"
attribute, those will be used as weights.</dd>


<dt>com</dt>
<dd>community membership integer vector. Each element corresponds to a vertex.</dd>

</dl>

normalized_cut: Normalized cut

Description

Usage

Value

Arguments

See Also

Examples