A. Clauset’s scientific contributions

... This heuristic algorithm is widely used due to its speed and high-quality results. We also consider the Leiden algorithm (Traag, V.A. et al., 2019), a refinement of the Louvain method, as well as other classical methods such as Walktrap (Pons, P., & Latapy, M., 2005), Infomap (Rosvall, M. et al., 2009), the Fast Greedy (Clauset, A. et al., 2004) and the Surprise (Marchese, E. et al., 2022) algorithm. In general, classical methods are defined for non-directed networks. ...

Reference:

Improving community detection algorithms in directed graphs with fuzzy measures. An application to mobility networks

... In particular, it was observed that the cumulative community size distribution obeys a power law with some parameter λ. For instance, [14] reports that λ = 1 for some networks; [3] obtains either λ = 0.5 or λ = 1; [22] also observes a power law with λ close to 0.5 in some range of cluster sizes; [39] studies the overlapping communities and shows that λ is ranging between 1 and 1.6. ...

Reference:

Preferential placement for community structure formation