cut_ratio

The cut ratio of a graph's community is the total edge weight connecting the community
to the rest of the graph divided by number of unordered pairs of vertices such that one
belongs to the community and the other does not.

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

cut_ratio 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

Cut Ratio — cut_ratio

<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>

cut_ratio: Cut Ratio

Description

Usage

Value

Arguments

See Also

Examples