auxiliary_functions

Given a weighted graph and a partition into communities, returns the
internal edge weight, the size, and the cut weight for each community.

internal

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

auxiliary_functions function

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

Arguments

Auxiliary Functions of a Graph Partition — auxiliary_functions

<dl>

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


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


<dt>edgelist</dt>
<dd>alternatively, the edgelist of the graph</dd>

</dl>

auxiliary_functions: Auxiliary Functions of a Graph Partition

Description

Usage

Arguments