Dynamic Community Detection

Community detection is one of the most popular topics in the field of network analysis. Since the seminal paper of Girvan and Newman (2002), hundreds of papers have been published on the topic. From the initial problem of graph partitioning, in which each node of the network must belong to one and only one community, new aspects of community structures have been taken into consideration, such as overlapping communities and hierarchical decomposition. Recently, new methods have been proposed, which can handle dynamic networks. The communities found by these algorithms are called dynamic communities.