Fast unfolding of communities in large networks: 15 years later
Not on the map. Why?
Abstract (arXiv)
The Louvain method was proposed 15 years ago as a heuristic method for the fast detection of communities in large networks. During this period, it has emerged as one of the most popular methods for community detection, the task of partitioning vertices of a network into dense groups, usually called communities or clusters. Here, after a short introduction to the method, we give an overview of the different generalizations and modifications that have been proposed in the literature, and also survey the quality functions, beyond modularity, for which it has been implemented.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 10 Nov 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 4; 2026: 1.
6 papers.
- 2025Co-Activation Graph Analysis of Safety-Verified and Explainable Deep Reinforcement Learning Policiescited by 2
- 2025From Leiden to Pleasure Island: The Constant Potts Model for Community Detection as a Hedonic Gamecited by 2
- 2024Disentangled and Self-Explainable Node Representation Learningcited by 1
- 2025Adaptive Long-term Embedding with Denoising and Augmentation for Recommendationcited by 1
- 2025A Graph Machine Learning Approach for Detecting Topological Patterns in Transactional Graphscited by 1
- 2026End-to-End Shared Attention Estimation via Group Detection with Feedback Refinementcited by 0
- 2026End-to-End Shared Attention Estimation via Group Detection with Feedback Refinement2 Apr 2026
- 2025A Graph Machine Learning Approach for Detecting Topological Patterns in Transactional Graphs16 Sep 2025
- 2025From Leiden to Pleasure Island: The Constant Potts Model for Community Detection as a Hedonic Game4 Sep 2025
- 2025Adaptive Long-term Embedding with Denoising and Augmentation for Recommendation18 Apr 2025
- 2025Co-Activation Graph Analysis of Safety-Verified and Explainable Deep Reinforcement Learning Policies6 Jan 2025
- 2024Disentangled and Self-Explainable Node Representation Learning28 Oct 2024