Calcuation of modularity and detection of the community strcture of a given network depicted by an (nonnegative symmetric) adjacency matrix using different modularity maximization algorithms
modMax package implements 38 algorithms of 6 major categories maximizing modularity, including the greedy approach, simulated annealing, extremal optimization, genetic algorithm, mathematical programming and the usage of local modularity.
All algorithms work on connected (consisting of only one connected component), undirected graphs given by their adjacency matrix.
Most algorithms also provide the possibility to compare the estimated modularity of the identified community structure with the modularity for random networks generated by null models with the number of vertices and edges conserved.
Maria Schelling, Cang Hui
Maintainer: Maria Schelling <firstname.lastname@example.org>
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.