This is a slight modification of Louvain's algorithm based on the Fast unfolding of communities in large networks paper. For optimizitaion, a metric Q is used. Q = modularity(C) + regularization(C), ...

Abstract: In this paper we present and evaluate a parallel community detection algorithm derived from the state-of-the-art Louvain modularity maximization method. Our algorithm adopts a novel graph ...

This Python script implements the Louvain community detection algorithm for detecting communities in networks. The Louvain algorithm is a popular method for identifying communities in large networks ...

The goodness of partitioning into communities is typically measured using a well known measure called modularity ... for serial community detection. In this paper, we present the design of a ...

Modularity-based ... of these methods are the Louvain algorithm, the Infomap algorithm, and the Girvan-Newman algorithm. Another approach to community detection is based on spectral graph theory ...

The past decade has been marked with a proliferation of community detection algorithms that aim to ... One striking commonality is that Newman's Spectral algorithm, Fast Modularity, and the Louvain ...

The traditional Louvain algorithm is a fast community detection algorithm with reliable results. The scale of complex networks is expanding larger all the time, and the efficiency of the Louvain ...