coverage

Computes the coverage (fraction of internal edges with respect to the total
number of edges) of a graph and its 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

coverage function

<dl><dt>g</dt>
<dd>Graph to be analyzed (as an <code>igraph</code> object).</dd>
<dt>com</dt>
<dd>Community membership integer vector. Each element corresponds to a vertex
of the graph, and contains the index of the community it belongs to.</dd></dl>

Arguments

Coverage — coverage

<dl>

<dt>g</dt>
<dd>Graph to be analyzed (as an <code>igraph</code> object).</dd>


<dt>com</dt>
<dd>Community membership integer vector. Each element corresponds to a vertex
of the graph, and contains the index of the community it belongs to.</dd>

</dl>

coverage: Coverage

Description

Usage

Value

Arguments

See Also

Examples