Used for evolving network analysis regarding
community detection. Implements several algorithms that calculate communities
for graphs whose nodes and edges change over time.
Edges, which can have new nodes, can be added or deleted. Changes in the
communities are calculated without recalculating communities for the entire
graph.
REFERENCE: M. Cordeiro et al. (2016) <DOI:10.1007/s13278-016-0325-1>
G. Rossetti et al. (2017) <DOI:10.1007/s10994-016-5582-8>
G. Rossetti (2017) <DOI:10.1093/comnet/cnx016>
R. Sarmento (2019) <arXiv:1904.12593>.

Dynamic Network Communities Detection and Generation

package-ubuntu-20.04-r-4.0.5#cran#DynComm-2020.1.6

<dl>
<dt>LOUVAIN</dt>
<dd>
See <code><a href="ALGORITHM_LOUVAIN.html">ALGORITHM_LOUVAIN</a></code>
</dd>
</dl>

This criterion does not require any parameters.

<code><a href="DynComm.html">DynComm</a></code>

package-ubuntu-20.04-r-4.0.5#cran#DynComm-2020.1.6#docs#CRITERION_MODULARITY

CRITERION_MODULARITY

Description

Supported in ALGORITHM

PARAMETERS

Author(s)

See Also

DynComm

We don't support your browser anymore