C McDiarmid,
F Skerman - Random Structures & Algorithms, 2020 - Wiley Online Library
For a given graph G, each partition of the vertices has a modularity score, with higher values
indicating that the partition better captures community structure in G. The modularity q∗(G) of …