GVE-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection in Shared Memory Setting

Abstract

Community detection is the problem of identifying natural divisions in networks. Efficient parallel algorithms for this purpose are crucial in various applications, particularly as datasets grow to substantial scales. This technical report presents an optimized parallel implementation of the Label Propagation Algorithm (LPA), a high speed community detection method, for shared memory multicore systems. On a server equipped with dual 16-core Intel Xeon Gold 6226R processors, our LPA, which we term as GVE-LPA, outperforms FLPA, igraph LPA, and NetworKit LPA by 139x, 97000x, and 40x respectively - achieving a processing rate of 1.4B edges/s on a 3.8B edge graph. In addition, GVE-LPA scales at a rate of 1.7x every doubling of threads.

arXiv comment9 pages, 7 figures, 1 table. arXiv admin note: text overlap with arXiv:2312.04876

References in corpus (6)

• Fast unfolding of communities in large networks
• Near linear time algorithm to detect community structures in large-scale networks
• Finding overlapping communities in networks by label propagation
• Engineering Parallel Algorithms for Community Detection in Massive Networks
• Large network community detection by fast label propagation
• Centralized Modularity of N-Linked Glycosylation Pathways in Mammalian Cells