Modularity Maximization
Greedy Algorithm
Published in
5 min readMay 30, 2020
Based on the hypothesis a random network does not have community structure, the local modularity concept was formulated [1]. It compares the partition of a given network with the analogous degree-preserved randomization.
Considering a network with N nodes and L links, and a partition of it with nc communities, each with Nc nodes and Lc links:
