DOE OSTI · 1567484
A Scalable Distributed Louvain Algorithm for Large-Scale Graph Community Detection
Abstract
We present a new distributed community detection algorithm for large graphs based on the Louvain method. We exploit a distributed delegate partitioning to ensure the workload and communication balancing among processors. In addition, we design a new heuristic strategy to carefully coordinate the community constitution in a distributed environment, and ensure the convergence of the distributed clustering algorithm. Our intensive experimental study has demonstrated the scalability and the correctness of our algorithm with various large-scale real-world and synthetic graph datasets using up to 32,768 processors.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Zeng, Jianping, Yu, Hongfeng. 2018-09-01. A Scalable Distributed Louvain Algorithm for Large-Scale Graph Community Detection. https://doi.org/10.1109/cluster.2018.00044
Cite the original work for its findings. Save a collection to share your selection of sources.