An improvement on the Louvain algorithm using random walks

DOI10.1007/S10878-025-01337-9MaRDI QIDQ6937750zbMATH OpenFDO

Authors Do Duy Hieu, Thi Ha Duong Phan

Publication date 26 August 2025

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-025-01337-9

zbMATH Keywords

community detectionLouvain algorithmNewman's spectral methodrandom walk

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Sums of independent random variables; random walks (60G50) Social networks; opinion dynamics (91D30)

Cites work

• A new metric to compare local community detection algorithms in social networks using geodesic distance
• Community structure in social and biological networks
• Computing Communities in Large Networks Using Random Walks
• Fast unfolding of communities in large networks
• scientific article; zbMATH DE number 878897 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Overlapping community detection algorithms using modularity and the cosine
• Synwalk: community detection via random walk modelling
• The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness

This page was built for publication: An improvement on the Louvain algorithm using random walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6937750)