Louvain (LV by Blondel et al.)

Home ▸ Algorithms ▸ Louvain (LV by Blondel et al.)

---

Louvain is another optimization algorithm proposed by Blondel et al. It is an improvement of FG, introducing a two-phase hierarchical agglomerative approach.

During the first phase, the algorithm applies a greedy optimization to identify the communities. During the second phase, it builds a new network whose nodes are the communities found during the first phase.

The intra-community links are represented by self-loops, whereas the inter-community links are aggregated and represented as links between the new nodes.

The process is repeated on this new network, and stops when only one community remains.

Back to Top