Community structure is largely regarded as an intrinsic property of complex real-world networks. However, recent studies reveal that networks comprise even more sophisticated modules than classical cohesive communities. More precisely, real-world networks can also be naturally partitioned according to common patterns of connections between the nodes. Recently, a propagation based algorithm has ...

The problem of community detection with two equal-sized communities is closely related to the minimum graph bisection over certain random models. In stochastic block model distribution networks structure, a well-known semidefinite programming (SDP) relaxation recovers underlying whenever possible. Motivated by their superior scalability, we study theoretical performance linear (LP) relaxations ...

A multiplex network models different modes of interaction among same-type entities. In this article, we provide a taxonomy community detection algorithms in networks. We characterize the based on various properties and discuss type communities detected by each method. then an extensive experimental evaluation reviewed methods to answer three main questions: what extent evaluated are able detect...