Algorithms & Math

Community detection identifies densely connected groups within networks. This guide covers key algorithms, comparison with clustering, modularity optimization, and practical applications.

The Louvain algorithm is a fast, greedy method for detecting communities in large networks through modularity optimization. This guide covers its mechanics, advantages, limitations, and implementation.

The Leiden algorithm improves upon Louvain by adding a refinement phase that guarantees well-connected communities. This guide covers its three-phase approach, quality improvements, and implementation.