Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

GVE-Leiden: Fast Leiden Algorithm for Community Detection in Shared Memory Setting (2312.13936v8)

Published 21 Dec 2023 in cs.DC and cs.PF

Abstract: Community detection is the problem of identifying natural divisions in networks. Efficient parallel algorithms for identifying such divisions is critical in a number of applications, where the size of datasets have reached significant scales. This technical report presents one of the most efficient implementations of the Leiden algorithm, a high quality community detection method. On a server equipped with dual 16-core Intel Xeon Gold 6226R processors, our Leiden implementation, which we term as GVE-Leiden, outperforms the original Leiden, igraph Leiden, NetworKit Leiden, and cuGraph Leiden (running on NVIDIA A100 GPU) by 436x, 104x, 8.2x, and 3.0x respectively - achieving a processing rate of 403M edges/s on a 3.8B edge graph. In addition, GVE-Leiden improves performance at an average rate of 1.6x for every doubling of threads.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (35)
  1. An improved Louvain algorithm based on Node importance for Community detection. Journal of Theoretical and Applied Information Technology 100, 23 (2022), 1–14.
  2. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008, 10 (Oct 2008), P10008.
  3. On modularity clustering. IEEE transactions on knowledge and data engineering 20, 2 (2007), 172–188.
  4. Hierarchical Parallel Algorithm for Modularity-Based Community Detection Using GPUs. In Proceedings of the 19th International Conference on Parallel Processing (Aachen, Germany) (Euro-Par’13). Springer-Verlag, Berlin, Heidelberg, 775–787.
  5. The igraph software package for complex network research. InterJournal, complex systems 1695, 5 (2006), 1–9.
  6. Adaptive parallel Louvain community detection on a multicore platform. Microprocessors and microsystems 54 (Oct 2017), 26–34.
  7. O. Gach and J. Hao. 2014. Improving the Louvain algorithm for community detection with modularity maximization. In Artificial Evolution: 11th International Conference, Evolution Artificielle, EA , Bordeaux, France, October 21-23, . Revised Selected Papers 11. Springer, Springer, Bordeaux, France, 145–156.
  8. Scaling and quality of modularity optimization methods for graph clustering. In IEEE High Performance Extreme Computing Conference (HPEC). IEEE, 1–6.
  9. Distributed louvain algorithm for graph community detection. In IEEE International Parallel and Distributed Processing Symposium (IPDPS). Vancouver, British Columbia, Canada, 885–895.
  10. S. Gregory. 2010. Finding overlapping communities in networks by label propagation. New Journal of Physics 12 (10 2010), 103018. Issue 10.
  11. Scalable static and dynamic community detection using Grappolo. In IEEE High Performance Extreme Computing Conference (HPEC). IEEE, Waltham, MA USA, 1–6.
  12. The SuiteSparse matrix collection website interface. The Journal of Open Source Software 4, 35 (Mar 2019), 1244.
  13. A. Lancichinetti and S. Fortunato. 2009. Community detection algorithms: a comparative analysis. Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics 80, 5 Pt 2 (Nov 2009), 056117.
  14. J. Leskovec. 2021. CS224W: Machine Learning with Graphs — 2021 — Lecture 13.3 - Louvain Algorithm. https://www.youtube.com/watch?v=0zuiLBOIcsw
  15. Parallel heuristics for scalable community detection. Parallel computing 47 (Aug 2015), 19–37.
  16. Accelerating Louvain community detection algorithm on graphic processing unit. The Journal of supercomputing (Nov 2020).
  17. Community detection on the GPU. In IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, Orlando, Florida, USA, 625–634.
  18. M. Newman. 2006. Finding community structure in networks using the eigenvectors of matrices. Physical review E 74, 3 (2006), 036104.
  19. Fabian Nguyen. [n. d.]. Leiden-Based Parallel Community Detection. Bachelor’s Thesis. Karlsruhe Institute of Technology, 2021 (zitiert auf S. 31).
  20. A simple acceleration method for the Louvain algorithm. International Journal of Computer and Electrical Engineering 8, 3 (2016), 207.
  21. Scalable community detection with the louvain algorithm. In IEEE International Parallel and Distributed Processing Symposium. IEEE, IEEE, Hyderabad, India, 28–37.
  22. R. Rotta and A. Noack. 2011. Multilevel local search algorithms for modularity clustering. Journal of Experimental Algorithmics (JEA) 16 (2011), 2–1.
  23. S. Ryu and D. Kim. 2016. Quick community detection of big graph data using modified louvain algorithm. In IEEE 18th International Conference on High Performance Computing and Communications (HPCC). IEEE, Sydney, NSW, 1442–1445.
  24. Subhajit Sahu. 2023. GVE-Louvain: Fast Louvain Algorithm for Community Detection in Shared Memory Setting. arXiv preprint arXiv:2312.04876 (2023).
  25. N. Sattar and S. Arifuzzaman. 2019. Overcoming MPI Communication Overhead for Distributed Community Detection. In Software Challenges to Exascale Computing, A. Majumdar and R. Arora (Eds.). Springer Singapore, Singapore, 77–90.
  26. Scalable community detection via parallel correlation clustering.
  27. NetworKit: A tool suite for large-scale complex network analysis. Network Science 4, 4 (2016), 508–530.
  28. V. Traag. 2015. Faster unfolding of communities: Speeding up the Louvain algorithm. Physical Review E 92, 3 (2015), 032801.
  29. Narrow scope for resolution-limit-free community detection. Physical Review E 84, 1 (2011), 016114.
  30. From Louvain to Leiden: guaranteeing well-connected communities. Scientific Reports 9, 1 (Mar 2019), 5233.
  31. Geerten Verweij. [n. d.]. Faster Community Detection Without Loss of Quality: Parallelizing the Leiden Algorithm. Master’s Thesis. Leiden University, 2020.
  32. L. Waltman and N. Eck. 2013. A smart local moving algorithm for large-scale modularity-based community detection. The European physical journal B 86, 11 (2013), 1–14.
  33. Fast parallel algorithm for unfolding of communities in large graphs. In IEEE High Performance Extreme Computing Conference (HPEC). IEEE, IEEE, Waltham, MA USA, 1–6.
  34. Research on improvement of Louvain community detection algorithm. In 2nd International Conference on Artificial Intelligence, Automation, and High-Performance Computing (AIAHPC ), Vol. 12348. SPIE, Zhuhai, China, 527–531.
  35. An improved Louvain algorithm for community detection. Mathematical Problems in Engineering 2021 (2021), 1–14.
Citations (4)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets