Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 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

An Approach for Addressing Internally-Disconnected Communities in Louvain Algorithm (2402.11454v5)

Published 18 Feb 2024 in cs.DC and cs.SI

Abstract: Community detection is the problem of identifying densely connected clusters within a network. While the Louvain algorithm is commonly used for this task, it can produce internally-disconnected communities. To address this, the Leiden algorithm was introduced. This technical report introduces GSP-Louvain, a parallel algorithm based on Louvain, which mitigates this issue. Running on a system with two 16-core Intel Xeon Gold 6226R processors, GSP-Louvain outperforms Leiden, NetworKit Leiden, and cuGraph Leiden by 391x, 6.9x, and 2.6x respectively, processing 410M edges per second on a 3.8B edge graph. Furthermore, GSP-Louvain improves performance at a rate of 1.5x for every doubling of threads.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (47)
  1. Emmanuel Abbe. 2018. Community detection and stochastic block models: recent developments. Journal of Machine Learning Research 18, 177 (2018), 1–86.
  2. Efficient and principled method for detecting communities in networks. Physical Review E 84, 3 (2011), 036103.
  3. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008, 10 (Oct 2008), P10008.
  4. On modularity clustering. IEEE transactions on knowledge and data engineering 20, 2 (2007), 172–188.
  5. B. Chatterjee and H. Saha. 2019. Detection of communities in large scale networks. In IEEE 10th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON). IEEE, 1051–1060.
  6. 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.
  7. Finding community structure in very large networks. Physical review E 70, 6 (2004), 066111.
  8. A classification for community discovery methods in complex networks. Statistical Analysis and Data Mining: The ASA Data Science Journal 4, 5 (2011), 512–546.
  9. The igraph software package for complex network research. InterJournal, complex systems 1695, 5 (2006), 1–9.
  10. Jordi Duch and Alex Arenas. 2005. Community detection in complex networks using extremal optimization. Physical review E 72, 2 (2005), 027104.
  11. Adaptive parallel Louvain community detection on a multicore platform. Microprocessors and microsystems 54 (Oct 2017), 26–34.
  12. S. Fortunato. 2010. Community detection in graphs. Physics reports 486, 3-5 (2010), 75–174.
  13. Santo Fortunato and Marc Barthelemy. 2007. Resolution limit in community detection. Proceedings of the national academy of sciences 104, 1 (2007), 36–41.
  14. Scalable distributed memory community detection using vite. In 2018 IEEE High Performance extreme Computing Conference (HPEC). IEEE, 1–7.
  15. S. Gregory. 2010. Finding overlapping communities in networks by label propagation. New Journal of Physics 12 (10 2010), 103018. Issue 10.
  16. BNEM: a fast community detection algorithm using generative models. Social Network Analysis and Mining 4 (2014), 1–20.
  17. Scalable static and dynamic community detection using Grappolo. In IEEE High Performance Extreme Computing Conference (HPEC). IEEE, Waltham, MA USA, 1–6.
  18. Detecting communities in complex networks using an adaptive genetic algorithm and node similarity-based encoding. Complexity 2023 (2022).
  19. K. Kloster and D. Gleich. 2014. Heat kernel based community detection. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, New York, USA, 1386–1395.
  20. The SuiteSparse matrix collection website interface. JOSS 4, 35 (2019), 1244.
  21. 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.
  22. J. Leskovec. 2021. CS224W: Machine Learning with Graphs — 2021 — Lecture 13.3 - Louvain Algorithm. https://www.youtube.com/watch?v=0zuiLBOIcsw
  23. Parallel heuristics for scalable community detection. Parallel computing 47 (Aug 2015), 19–37.
  24. Malte Luecken. 2016. Application of multi-resolution partitioning of interaction networks to the study of complex disease. Ph. D. Dissertation. University of Oxford.
  25. Mark EJ Newman. 2006. Modularity and community structure in networks. Proceedings of the national academy of sciences 103, 23 (2006), 8577–8582.
  26. Fabian Nguyen. [n. d.]. Leiden-Based Parallel Community Detection. Bachelor’s Thesis. Karlsruhe Institute of Technology, 2021 (zitiert auf S. 31).
  27. Near linear time algorithm to detect community structures in large-scale networks. Physical Review E 76, 3 (Sep 2007), 036106–1–036106–11.
  28. Jörg Reichardt and Stefan Bornholdt. 2006. Statistical mechanics of community detection. Physical review E 74, 1 (2006), 016110.
  29. M. Rosvall and C. Bergstrom. 2008. Maps of random walks on complex networks reveal community structure. Proceedings of the national academy of sciences 105, 4 (2008), 1118–1123.
  30. R. Rotta and A. Noack. 2011. Multilevel local search algorithms for modularity clustering. Journal of Experimental Algorithmics (JEA) 16 (2011), 2–1.
  31. 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.
  32. Subhajit Sahu. 2023a. GVE-Leiden: Fast Leiden Algorithm for Community Detection in Shared Memory Setting. arXiv preprint arXiv:2312.13936 (2023).
  33. Subhajit Sahu. 2023b. GVE-Louvain: Fast Louvain Algorithm for Community Detection in Shared Memory Setting. arXiv preprint arXiv:2312.04876 (2023).
  34. Scalable community detection via parallel correlation clustering.
  35. A classification of community detection methods in social networks: a survey. International journal of general systems 50, 1 (Jan 2021), 63–91.
  36. NetworKit: A tool suite for large-scale complex network analysis. Network Science 4, 4 (2016), 508–530.
  37. V.A. Traag and L. Šubelj. 2023. Large network community detection by fast label propagation. Scientific Reports 13, 1 (2023), 2701.
  38. From Louvain to Leiden: guaranteeing well-connected communities. Scientific Reports 9, 1 (Mar 2019), 5233.
  39. 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.
  40. Overlapping community detection using seed set expansion. In Proceedings of the 22nd ACM international conference on Information & Knowledge Management. 2099–2108.
  41. 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.
  42. PAGA: graph abstraction reconciles clustering with trajectory inference through a topology preserving map of single cells. Genome biology 20 (2019), 1–9.
  43. SLPA: Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In IEEE 11th International Conference on Data Mining Workshops. IEEE, IEEE, Vancouver, Canada, 344–349.
  44. A comparative analysis of community detection algorithms on artificial networks. Scientific reports 6, 1 (2016), 30750.
  45. A three-stage algorithm on community detection in social networks. Knowledge-Based Systems 187 (2020), 104822.
  46. N. Zarayeneh and A. Kalyanaraman. 2021. Delta-Screening: A Fast and Efficient Technique to Update Communities in Dynamic Graphs. IEEE transactions on network science and engineering 8, 2 (Apr 2021), 1614–1629.
  47. J. Zeng and H. Yu. 2015. Parallel Modularity-Based Community Detection on Large-Scale Graphs. In IEEE International Conference on Cluster Computing. 1–10.
Citations (3)
View on Semantic Scholar

Summary

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

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