An algorithm for overlapping community detection in complex network

In complex network, overlapping community structure is a more actual description of the structure of social networks. So, it is significant to analyze its overlapping community structure. After integrating the existing overlapping community detection algorithms and information theory, we summarize a definition of community from the perspective of information theory, then we present an algorithm to detect the overlapping community structure in complex networks after having learnt from the information dissemination theory. Experimental results illustrate that compared with the traditional definition of community and detection algorithms, the community that is detected by our algorithm have a more accurate physical meaning, meanwhile, this algorithm has a lower time complexity too.

[1]  Boleslaw K. Szymanski,et al.  Overlapping community detection in networks: The state-of-the-art and comparative study , 2011, CSUR.

[2]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[3]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

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

[5]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[6]  L. Freeman,et al.  Centrality in social networks: ii. experimental results☆ , 1979 .

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

[8]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[9]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[10]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[11]  Fergal Reid,et al.  Detecting highly overlapping community structure by greedy clique expansion , 2010, KDD 2010.

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

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

[14]  J. A. Rodríguez-Velázquez,et al.  Subgraph centrality in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[16]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[17]  Vladimir Batagelj,et al.  Centrality in Social Networks , 1993 .

[18]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[19]  L. Jiao,et al.  Adjusting from disjoint to overlapping community detection of complex networks , 2009 .

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

[21]  Steve Gregory,et al.  Finding overlapping communities in networks by label propagation , 2009, ArXiv.

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