Community detection using boundary nodes in complex networks

Abstract We propose a new local community detection algorithm that finds communities by identifying borderlines between them using boundary nodes. Our method performs label propagation for community detection, where nodes decide their labels based on the largest “benefit score” exhibited by their immediate neighbors as an attractor to their communities. We try different metrics and find that using the number of common neighbors as benefit scores leads to better decisions for community structure. The proposed algorithm has a local approach and focuses only on boundary nodes during iterations of label propagation, which eliminates unnecessary steps and shortens the overall execution time. It preserves small communities as well as big ones and can outperform other algorithms in terms of the quality of the identified communities, especially when the community structure is subtle. The algorithm has a distributed nature and can be used on large networks in a parallel fashion.

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

[2]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[3]  A-L Barabási,et al.  Structure and tie strengths in mobile communication networks , 2006, Proceedings of the National Academy of Sciences.

[4]  J. Herskowitz,et al.  Proceedings of the National Academy of Sciences, USA , 1996, Current Biology.

[5]  Jean-Charles Delvenne,et al.  The many facets of community detection in complex networks , 2016, Applied Network Science.

[6]  S. Snyder,et al.  Proceedings of the National Academy of Sciences , 1999 .

[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]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.

[9]  Haluk Bingol,et al.  Community detection using preference networks , 2017, ArXiv.

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

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

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

[13]  M. Newman.  Clustering and preferential attachment in growing networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Xingyuan Wang,et al.  Community detection using local neighborhood in complex networks , 2015 .

[16]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

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

[18]  Boleslaw K. Szymanski,et al.  Community detection using a neighborhood strength driven Label Propagation Algorithm , 2011, 2011 IEEE Network Science Workshop.

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

[20]  Jingchun Chen,et al.  Detecting functional modules in the yeast protein-protein interaction network , 2006, Bioinform..

[21]  Leto Peel,et al.  The ground truth about metadata and community detection in networks , 2016, Science Advances.

[22]  Santo Fortunato,et al.  Finding Statistically Significant Communities in Networks , 2010, PloS one.

[23]  Martin Rosvall,et al.  An information-theoretic framework for resolving community structure in complex networks , 2007, Proceedings of the National Academy of Sciences.

[24]  Pasquale De Meo,et al.  Mixing local and global information for community detection in large networks , 2013, J. Comput. Syst. Sci..

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

[26]  M. Mézard,et al.  Journal of Statistical Mechanics: Theory and Experiment , 2011 .

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

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

[29]  Federica Mandreoli,et al.  Journal of Computer and System Sciences Special Issue on Query Answering on Graph-Structured Data , 2016, Journal of computer and system sciences (Print).

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