Community Detection in Networks: A Comparative study

In this paper, various approaches for community detection in complex networks are studied. The existence of community structure is most important features for community detection algorithms in a complex network. These algorithms are based on order to unmask the structural properties of the network and dynamic behaviors with the maximization of modularity. As a result, one of the most challenging problems in network is community detection i.e. NP-hard in modern network science. In this paper an improved Louvain Algorithm has been embodied that reduces the computational time and also maximize the modularity due to resolution limit.