Search for overlapped communities by parallel genetic algorithms

— In the last decade the broad scope of complex networks has led to a rapid progress. In this area a particular interest has the study of community structures. The analysis of this type of structure requires the formalization of the intuitive concept of community and the definition of indices of goodness for the obtained results. A lot of algorithms has been presented to reach this goal. In particular, an interesting problem is the search of overlapped communities and it is field seems very interesting a solution based on the use of genetic algorithms. The approach discusses in this paper is based on a parallel implementation of a genetic algorithm and shows the performance benefits of this solution.

[1]  E A Leicht,et al.  Community structure in directed networks. , 2007, Physical review letters.

[2]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

[3]  Sergio Gómez,et al.  Size reduction of complex networks preserving modularity , 2007, ArXiv.

[4]  David L. Levine,et al.  Users guide to the PGAPack parallel genetic algorithm library , 1995 .

[5]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[6]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

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

[8]  Javier Béjar,et al.  Clustering algorithm for determining community structure in large networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[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]  Haluk Bingol,et al.  Community Detection in Complex Networks Using Genetic Algorithms , 2006, 0711.0491.

[11]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .

[12]  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.

[13]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[14]  Vincenza Carchiolo,et al.  Extending modularity definition for directed graphs with overlapping communities , 2008 .

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

[16]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[17]  R. J. Mokken,et al.  Cliques, clubs and clans , 1979 .

[18]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[20]  Stephen B. Seidman,et al.  A graph‐theoretic generalization of the clique concept* , 1978 .

[21]  V. Carchiolo,et al.  Extending the definition of modularity to directed graphs with overlapping communities , 2008, 0801.1647.

[22]  Per Bak,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness, by Duncan J. Watts , 2000 .

[23]  R. Luce,et al.  Connectivity and generalized cliques in sociometric group structure , 1950, Psychometrika.

[24]  R. Alba.  A graph‐theoretic definition of a sociometric clique† , 1973 .