A Study on Algorithms for Detection of Communities in Dynamic Social Networks: A Review

Community within the social networks is demarcated as collection of nodes which are thickly associated among them whereas sparingly associated to nodes exterior to the community. The problem of community detection is a key topic of research and has gained enough attention over last two decades. Considering the case of Dynamic Social Networks those changes with time community detection is an important issue. The existence of overlapping communities has complicated the task of community detection. In this review work, the authors have illustrated a few community detection algorithms that discover communities within dynamic social networks. An analysis of the discussed algorithms with a focus on the further research work has been done and a real life examples have been cited in the paper.