Community Detection via Neighborhood Overlap and Spanning Tree Computations

Most social networks of today are populated with several millions of active users, while the most popular of them accommodate way more than one billion. Analyzing such huge complex networks has become particularly demanding in computational terms. A task of paramount importance for understanding the structure of social networks as well as of many other real-world systems is to identify communities, that is, sets of nodes that are more densely connected to each other than to other nodes of the network. In this paper we propose two algorithms for community detection in networks, by employing the neighborhood overlap metric and appropriate spanning tree computations.

[1]  Sune Lehmann,et al.  Link communities reveal multiscale complexity in networks , 2009, Nature.

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

[3]  Jure Leskovec,et al.  Overlapping community detection at scale: a nonnegative matrix factorization approach , 2013, WSDM.

[4]  Natarajan Meghanathan,et al.  A Greedy Algorithm for Neighborhood Overlap-Based Community Detection , 2016, Algorithms.

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

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

[7]  Alex Delis,et al.  COEUS: Community detection via seed-set expansion on graph streams , 2017, 2017 IEEE International Conference on Big Data (Big Data).

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

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

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

[11]  Jure Leskovec,et al.  Local Higher-Order Graph Clustering , 2017, KDD.

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

[13]  Alex Delis,et al.  Scalable link community detection: A local dispersion-aware approach , 2016, 2016 IEEE International Conference on Big Data (Big Data).

[14]  J. Reichardt,et al.  Statistical mechanics of community detection. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[17]  Jure Leskovec,et al.  Learning to Discover Social Circles in Ego Networks , 2012, NIPS.