Performance Evaluation of Modularity Based Community Detection Algorithms in Large Scale Networks

Abstract EN

Community structure detection is one of the major research areas of network science and it is particularly useful for large real networks applications.

This work presents a deep study of the most discussed algorithms for community detection based on modularity measure: Newman’s spectral method using a fine-tuning stage and the method of Clauset, Newman, and Moore (CNM) with its variants.

The computational complexity of the algorithms is analysed for the development of a high performance code to accelerate the execution of these algorithms without compromising the quality of the results, according to the modularity measure.

The implemented code allows the generation of partitions with modularity values consistent with the literature and it overcomes 1 million nodes with Newman’s spectral method.

The code was applied to a wide range of real networks and the performances of the algorithms are evaluated.