A Template for Parallelizing the Louvain Method for Modularity Maximization

Detecting communities using modularity maximization is an important operation in network analysis. As the size of the networks increase to petascales, it is important to design parallel algorithms to handle the large-scale data. In this chapter, a shared memory (OpenMP-based) implementation of the Louvain method, one of the most popular algorithms for maximizing modularity, is introduced. This chapter also discusses the challenges in parallelizing this algorithm as well as metrics for evaluating the correctness of the results. The results demonstrate that the implementation is highly scalable. Moreover, it also focuses on how this template can be extended to time-varying networks.

[1]  Sanjukta Bhowmick,et al.  Fast Community Detection for Dynamic Complex Networks , 2011, CompleNet.

[2]  Mason A. Porter,et al.  Communities in Networks , 2009, ArXiv.

[3]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Benjamin H. Good,et al.  Performance of modularity maximization in practical contexts. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Ankur Narang,et al.  Fast Community Detection Algorithm with GPUs and Multicore Architectures , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[6]  David A. Bader,et al.  Tracking Structure of Streaming Social Networks , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[7]  Ulrik Brandes,et al.  On Modularity Clustering , 2008, IEEE Transactions on Knowledge and Data Engineering.

[8]  Jean-Loup Guillaume,et al.  Fast unfolding of community hierarchies in large networks , 2008, ArXiv.

[9]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[10]  David A. Bader,et al.  Parallel Community Detection for Massive Graphs , 2011, PPAM.

[11]  William M. Rand,et al.  Objective Criteria for the Evaluation of Clustering Methods , 1971 .

[12]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  V A Traag,et al.  Narrow scope for resolution-limit-free community detection. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.