Abstract:
Community detection is one of the most important research area wherein invention and growth
of social networks. Community is a set of members densely connected within a group and sparely connected
with the other groups. In social networks, the singular characteristic of communities is multi membership of a
node resulting in overlapping communities. Another relevant feature of social networks is the possibility to
evolve over time. In recent years, many researchers have worked on various methods that can efficiently
unveil overlapped structure on dynamic network. This paper reviews the previous studies done on the
problem of overlapping community detection algorithms. Moreover, some approaches for dynamic network
that change from time to time are also described.
