Automatic Detection of Multilevel Communities: Scalable, Selective and Resolution-Limit-Free

Abstract

Community structure is one of the most important features of complex networks. Modularity-based methods for community detection typically rely on heuristic algorithms to optimize a specific community quality function. Such methods have two major limits: (1) the resolution limit problem, which prohibits communities of heterogeneous sizes being simultaneously detected, and (2) divergent outputs of the heuristic algorithm, which make it difficult to differentiate relevant and irrelevant results. In this paper, we propose an improved method for community detection based on a scalable community “fitness function.” We introduce a new parameter to enhance its scalability, and a strict strategy to filter the outputs. Due to the scalability, on the one hand, our method is free of the resolution limit problem and performs excellently on large heterogeneous networks, while on the other hand, it is capable of detecting more levels of communities than previous methods in deep hierarchical networks. Moreover, our strict strategy automatically removes redundant and irrelevant results; it selectively but inartificially outputs only the best and unique community structures, which turn out to be largely interpretable by the a priori knowledge of the network, including the implanted community structures within synthetic networks, or metadata observed for real-world networks.

Keywords

• community detection
• resolution limit problem
• modularity
• multilevel community
• Louvain algorithm