Community Detection
Modularity optimization on planted-partition random graphs
Controls
Communities K
4
Nodes per community
12
Within-community p
0.60
Between-community p
0.05
Generate Graph
Run Detection
Q = —
Modularity Q measures how much edge density within communities exceeds chance. Q = (fraction of within-community edges) − (expected fraction). Q ∈ [−1, 1]. Greedy algorithm merges communities to maximize ΔQ.