Unfolding network communities by combining defensive and offensive label propagation

Label propagation has proven to be a fast method for detecting communities in complex networks. Recent work has also improved the accuracy and stability of the basic algorithm, however, a general approach is still an open issue. We propose different label propagation algorithms that convey two unique strategies of community formation, namely, defensive preservation and offensive expansion of communities. Furthermore, the strategies are combined in an advanced label propagation algorithm that retains the advantages of both approaches; and are enhanced with hierarchical community extraction, prominent for the use on larger networks. The proposed algorithms were empirically evaluated on different benchmarks networks with planted partition and on over 30 real-world networks of various types and sizes. The results confirm the adequacy of the propositions and give promising grounds for future analysis of (large) complex networks. Nevertheless, the main contribution of this work is in showing that different types of networks (with different topological properties) favor different strategies of community formation.

[1]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[4]  Matthew Richardson,et al.  Trust Management for the Semantic Web , 2003, SEMWEB.

[5]  Jure Leskovec,et al.  The dynamics of viral marketing , 2005, EC '06.

[6]  M. Barber,et al.  Detecting network communities by propagating labels under constraints. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  R. Carter.  11 – IT and society , 1991 .

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

[9]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

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

[11]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[12]  Lian Wen,et al.  Software Systems as Complex Networks , 2007, 6th IEEE International Conference on Cognitive Informatics.

[13]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[14]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[15]  Marko Bajec,et al.  Unfolding communities in large complex networks: Combining defensive and offensive label propagation for core extraction , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

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

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

[19]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[20]  E A Leicht,et al.  Mixture models and exploratory analysis in networks , 2006, Proceedings of the National Academy of Sciences.

[21]  P. Ronhovde,et al.  Local resolution-limit-free Potts model for community detection. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[23]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[24]  J. Kertész,et al.  On the equivalence of the label propagation method of community detection and a Potts model approach , 2008, 0803.2804.

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

[26]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

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

[28]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

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

[30]  Tsuyoshi Murata,et al.  Community Detection in Large-scale Bipartite Networks , 2010 .

[31]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

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

[33]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.

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

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

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

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

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

[39]  A Díaz-Guilera,et al.  Self-similar community structure in a network of human interactions. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

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

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

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

[45]  Shujing Li,et al.  Detecting Community Structure in Networks by Propagating Labels of Nodes , 2009, ISNN.

[46]  T. Murata,et al.  Advanced modularity-specialized label propagation algorithm for detecting communities in networks , 2009, 0910.1154.