Résumé: Overlapping community detection with low computation is one of the fundamental issues and challenges in large-scale complex network analysis. Detecting a community in a network means discovering a cluster of network nodes so that the density of edges between them is high. The existing methods use entire structure information or subgraphs with a fixed size to detect dense communities. Therefore, they are not efficient and accurate for large-scale networks. In this paper, the authors introduce an overlapping community detection algorithm that gradually improves density estimation by expanding the size of subgraphs and gathering information during the search process for finding communities. It is an efficient algorithm with low computational complexity for complex networks with one hundred thousand to several millions of nodes. Experimental results on synthetic and real-world networks with several hundred to four million nodes validate the performance assessment of the proposed method.

Langue: Anglais