Evolutionary Computation for Community Detection in Networks: a Review

In todays world, the interconnections among objects in many domains are often modeled as networks, with nodes representing the objects and edges the existing relationships among them. A key feature of complex networks is the tendency of entities to group together to form communities. The detection of communities has been receiving a great deal of interest by researchers. In fact, the knowledge of how objects organize allows a better understanding of a network, and gives a deeper insight of interesting characteristics, that could not be caught if considering the network as a whole. In the last decade, evolutionary computation techniques have given a significant contribution in this context. The aim of this review is to present the approaches based on evolutionary computation to uncover community structure. Especially, the representation schemes with the genetic operators apt for them are described, and the most popular fitness functions employed by the methods are discussed. The survey covers the most recent proposals optimizing either a single objective or multiple objectives for different types of network models, such as signed, dynamic, multidimensional.