FOMD

Given a weighted graph and a partition into communities, returns the fraction
of nodes of each community whose internal degree (i.e. the degree accounting
only intra-community edges) is greater than the median degree of the whole
graph.

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

FOMD 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>
<dt>edgelist</dt>
<dd>alternatively, the edgelist of the graph, as a matrix where the
first two columns to the vertices and the third is the weight of each edge.</dd></dl>

Arguments

FOMD (Fraction Over Median Degree) — FOMD

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


<dt>edgelist</dt>
<dd>alternatively, the edgelist of the graph, as a matrix where the
first two columns to the vertices and the third is the weight of each edge.</dd>

</dl>

FOMD: FOMD (Fraction Over Median Degree)

Description

Usage

Value

Arguments

See Also

Examples