Community Detection in Dynamic Networks via Adaptive Label Propagation

Abstract

An adaptive label propagation algorithm (ALPA) is proposed to detect and monitor communities in dynamic networks. Unlike the traditional methods by re-computing the whole community decomposition after each modification of the network, ALPA takes into account the information of historical communities and updates its solution according to the network modifications via a local label propagation process, which generally affects only a small portion of the network. This makes it respond to network changes at low computational cost. The effectiveness of ALPA has been tested on both synthetic and real-world networks, which shows that it can successfully identify and track dynamic communities. Moreover, ALPA could detect communities with high quality and accuracy compared to other methods. Therefore, being low-complexity and parameter-free, ALPA is a scalable and promising solution for some real-world applications of community detection in dynamic networks.

16 pages, 11 figures

References in corpus (12)

• Fast unfolding of communities in large networks
• Modularity and community structure in networks
• Maps of random walks on complex networks reveal community structure
• Near linear time algorithm to detect community structures in large-scale networks
• Benchmark graphs for testing community detection algorithms
• Comparing community structure identification
• Stochastic blockmodels and community structure in networks
• Quantifying social group evolution
• Finding statistically significant communities in networks
• An information-theoretic framework for resolving community structure in complex networks
• Dynamic stochastic blockmodels for time-evolving social networks
• Surprise maximization reveals the community structure of complex networks