internal_density

Internal density of a graph's communities. That is, the sum of weights of their 
edges divided by the number of unordered pairs of vertices (which is the number of potential edges).

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

internal_density 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

Internal Density — internal_density

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

internal_density: Internal Density

Description

Usage

Value

Arguments

See Also

Examples