Detect local communities in networks with an outside rate coefficient

In this paper, we present a local method for detecting communities in networks. We define an outside rate coefficient ψout in our method. ψout has a very simple form and is easy to calculate. The local community enclosing a starting node can be detected by agglomerating the node with the smallest ψout at each time step. When there are two or more nodes having the same smallest outside rate coefficient ψout, we agglomerate the node with the largest kin. This operation is remarkably beneficial to the accuracy of our method, and simulations on benchmark networks and real networks demonstrate that our local method is efficient to detect communities in networks.

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

[2]  Erik M Bollt,et al.  Local method for detecting communities. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Laura A. Kelleher.  Navigating the Internet-A Merit Network Cruise , 1992, Comput. Networks ISDN Syst..

[4]  Mark C. Parsons,et al.  Social networks: Evolving graphs with memory dependent edges , 2011 .

[5]  István Csabai,et al.  Inferring the background traffic arrival process in the Internet. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Xueqi Cheng,et al.  Modeling the clustering in citation networks , 2011, ArXiv.

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

[8]  James P. Bagrow.  Evaluating local community methods in networks , 2007, 0706.3880.

[9]  A. Clauset.  Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  J. Fowler,et al.  Distance Measures for Dynamic Citation Networks , 2009, 0909.1819.

[11]  R. Guimerà,et al.  Modularity from fluctuations in random graphs and complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

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

[15]  Jean-Loup Guillaume,et al.  Fast unfolding of community hierarchies in large networks , 2008, ArXiv.

[16]  Leon Danon,et al.  The effect of size heterogeneity on community identification in complex networks , 2006, physics/0601144.

[17]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[18]  C. Lee Giles,et al.  Efficient identification of Web communities , 2000, KDD '00.

[19]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

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

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

[22]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.

[23]  Kamel Hooman,et al.  Evaluating transport in irregular pore networks. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.