Many alternatives to the Louvain algorithm have been proposed. Among them are the following:
- Algorithms involving a resolution parameter γ in order to tackle the resolution limit of the Louvain algorithm.
- The Leiden algorithm is a variant of the Louvain algorithm, which is also able to split clusters instead of just merging them. By doing so, the Leiden algorithm is able to guarantee that communities will be well-connected, which is not the case with the Louvain algorithm (see the Further reading section for links to resources going deeper into this topic).
These algorithms have been proven to perform better than Louvain in the cases listed in the preceding section. However, there are two other cases that are covered by none of the algorithms addressed so far:
- Overlapping communities: Cases where a given node can belong to several communities
- Dynamic networks: How do communities change when the network evolves with time (new edges and/or new nodes...
