Child pages
  • Louvain Community Detection

Versions Compared


  • This line was added.
  • This line was removed.
  • Formatting was changed.


The Louvain community detection algorithm is an algorithm for performing community detection (clustering) in networks by maximizing a modularity function. The Louvain algorithm can be used to detect communities in very large networks within short computing times. Compared with the original Louvain algorithm proposed by Blondel et al. (2008), the implementation of the Louvain algorithm available in Sci2 offers Sci2 offers a resolution parameter that can be used to customize the granularity level at which communities are detected. In addition, as proposed by Waltman and Van Eck (2013), it is possible to perform multiple iterations of the Louvain algorithm. This usually yields higher modularity values.