Detecting Network Community by Propagating Labels Based on Contact-Specific Constraint

As a famous community detection algorithm with near linear time complexity, Label Propagation Algorithm (LPA) has been an active research direction. However, that LPA regards that all the neighbor have the same importance to target node in target node’s label update process make it get stuck in poor stability. From the view of structural holes in sociology, people who fill structural holes bring social order to the network, so we improve LPA based on contact-specific constraint measuring structural holes. Experiments show that our improvement successfully detects communities with the highest stability in several commonly used real-world and synthetic networks.

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

[2]  Pietro Liò,et al.  Towards real-time community detection in large networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  R. Burt.  Brokerage and Closure: An Introduction to Social Capital , 2005 .

[4]  Steven B. Andrews,et al.  Structural Holes: The Social Structure of Competition , 1995, The SAGE Encyclopedia of Research Design.

[5]  Gerardo Iñiguez,et al.  Opinion and community formation in coevolving networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[8]  Konstantin Avrachenkov,et al.  Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.

[9]  Marko Bajec,et al.  Robust network community detection using balanced propagation , 2011, ArXiv.

[10]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

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

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

[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]  Mingwei Leng,et al.  A Node Importance Based Label Propagation Approach for Community Detection , 2014 .

[15]  R. Burt.  Structural Holes and Good Ideas1 , 2004, American Journal of Sociology.

[16]  Xiuzhen Chen,et al.  Community Detection Using Label Propagation in Entropic Order , 2012, 2012 IEEE 12th International Conference on Computer and Information Technology.

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

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