An overlapping community detection algorithm based on Lévy flight

Considering the phenomenon that most intelligent optimization algorithms easily plunge into local optimum when solving the complex problem of overlapping community detection, LFOCDA, an overlapping community detection algorithm based on Lévy flight, is proposed in this paper. An extended modularity function has been used as the quality measurement standard of overlapping community division. During the iterative renewed process, Lévy flight has been introduced owing to the variable-step random walk characteristic, so that the algorithm has a chance to jump out of local optimum, thus expanding the search range and guiding the search closer to global optimal solution. Enormous experimental results have verified the effectiveness and adaptability of the algorithm.

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

[2]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[4]  Matt Grove,et al.  Ranging patterns of hamadryas baboons: random walk analyses , 2010, Animal Behaviour.

[5]  M. A. Muñoz,et al.  Journal of Statistical Mechanics: An IOP and SISSA journal Theory and Experiment Detecting network communities: a new systematic and efficient algorithm , 2004 .

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

[7]  Xiao Nan-feng,et al.  Discovering Overlapping Communities Based on Line Graph and PSO , 2011 .

[8]  Nicolas E. Humphries,et al.  Environmental context explains Lévy and Brownian movement patterns of marine predators , 2010, Nature.

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

[10]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[11]  Steve Gregory,et al.  An Algorithm to Find Overlapping Community Structure in Networks , 2007, PKDD.

[12]  Dayou Liu,et al.  A Markov random walk under constraint for discovering overlapping communities in complex networks , 2011, ArXiv.

[13]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

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

[15]  Mao-Bin Hu,et al.  Detect overlapping and hierarchical community structure in networks , 2008, ArXiv.