edges_inside

Number of edges inside a graph's communities, or their accumulated weight if
the graph's edges are weighted.

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

edges_inside 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

Edges Inside — edges_inside

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

edges_inside: Edges Inside

Description

Usage

Value

Arguments

See Also

Examples