Community detection new

analysisstylesclustering

This example demonstrates the Leiden community detection algorithm — an improvement over the Louvain algorithm that guarantees well-connected communities.

A synthetic graph is generated using a stochastic block model (6 communities, 15 nodes each). Click Detect communities to run Leiden and colour each node by its detected community. Use the Resolution γ slider to control granularity: higher values yield more, smaller communities.

Reference: Traag, Waltman & van Eck (2019). From Louvain to Leiden: guaranteeing well-connected communities. Scientific Reports 9, 5233.