An EDA-based community detection in complex networks

Communities are basic units of complex networks and understanding of their structure help us to understand the structure of a network. Communities are groups of nodes that have many links inside and few links outside them. Community detection in a network can be modeled as an optimization problem. We can use some measures such as Modularity and Community Score for evaluating the quality of a partition of nodes. In this paper, we present a new algorithm for detecting communities in networks based on an Estimation of Distribution Algorithm (EDA) with the assumption that the problem variables are independent. EDAs are those evolutionary algorithms that build and sample the probabilistic models of selected solutions instead of using crossover and mutation operators. In this paper, we assess our algorithm by synthetic and real data sets and compare it with other community detection algorithms.

[1]  M. Newman,et al.  Robustness of community structure in networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[3]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Clara Pizzuti,et al.  Mesoscopic analysis of networks with genetic algorithms , 2013, World Wide Web.

[5]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[6]  Martin Pelikan,et al.  An introduction and survey of estimation of distribution algorithms , 2011, Swarm Evol. Comput..

[7]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[8]  Clara Pizzuti,et al.  GA-Net: A Genetic Algorithm for Community Detection in Social Networks , 2008, PPSN.

[9]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.

[11]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[12]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[14]  Jianwu Li,et al.  Community detection in complex networks using extended compact genetic algorithm , 2012, Soft Computing.

[15]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.