The modularity of an optimal network partition can be used to measure the quality of its community structure. Though modularity-maximization is NP-hard, the approximation algorithm of Blondel et al. [1]} (a.k.a. the “Louvain algorithm”) has been shown to produce near-optimal partitions.Louvain modularity was computed using the implementation available from CRANS at http://perso.crans.org/aynaud/communities/. The modularity associated with this algorithm is often called the “Louvain modularity” and the associated partition is a “Louvain partition.”
