Fast unfolding of communities in large networks: 15 years later

November 10, 2023 Β· Declared Dead Β· πŸ› Journal of Statistical Mechanics: Theory and Experiment

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Vincent Blondel, Jean-Loup Guillaume, Renaud Lambiotte arXiv ID 2311.06047 Category physics.soc-ph Cross-listed cs.SI Citations 33 Venue Journal of Statistical Mechanics: Theory and Experiment Last Checked 3 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted