Graph

Preset

Nodes: 60 Planted communities: 3 Within-group prob p_in: 0.50 Between-group prob p_out: 0.03

Louvain

Speed: 1.0×

Stats

Nodes0

Edges0

Modularity Q0.000

Communities0

Pass / level0 / 0

Statusready

The Louvain method maximizes modularity Q = (1/2m)·Σ[A_ij − k_ik_j/2m]·δ(c_i,c_j). Each Step runs one pass: nodes greedily move to the neighbour community giving the best ΔQ (local moving), then communities collapse into super-nodes (aggregation). Q rises until no move helps. Drag nodes to rearrange.