Partitioning Breaks Communities

Considering a clique as a conservative definition of community structure, we examine how graph partitioning algorithms interact with cliques. Many popular community-finding algorithms partition the entire graph into non-overlapping communities. We show that on a wide range of empirical networks, from different domains, significant numbers of cliques are split across separate partitions, as produced by such algorithms. We examine the largest connected component of the sub graph formed by retaining only edges in cliques, and apply partitioning strategies that explicitly minimise the number of cliques split. We conclude that, due to the connectedness of many networks, any community finding algorithm that produces partitions must fail to find at least some significant structures. Moreover, contrary to traditional intuition, in some empirical networks, strong ties and cliques frequently do cross community boundaries.

[1]  M. Macy,et al.  Complex Contagions and the Weakness of Long Ties1 , 2007, American Journal of Sociology.

[2]  Steve Gregory,et al.  Detecting communities in networks by merging cliques , 2009, 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems.

[3]  R. Lambiotte,et al.  Line graphs, link partitions, and overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Esteban Moro,et al.  Social Features of Online Networks: The Strength of Intermediary Ties in Online Social Media , 2011, PloS one.

[5]  Mao-Bin Hu,et al.  Detect overlapping and hierarchical community structure in networks , 2008, ArXiv.

[6]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[7]  Alexander Struck,et al.  Identification of Overlapping Communities by Locally Calculating Community-Changing Resolution Levels , 2010 .

[8]  S. Goyal,et al.  Strong Ties in a Small World , 2006 .

[9]  R. Luce,et al.  A method of matrix analysis of group structure , 1949, Psychometrika.

[10]  Emden R. Gansner,et al.  Graphviz and Dynagraph - Static and Dynamic Graph Drawing Tools , 2004, Graph Drawing Software.

[11]  Inderjit S. Dhillon,et al.  Weighted Graph Cuts without Eigenvectors A Multilevel Approach , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[13]  Mason A. Porter,et al.  Community Structure in Online Collegiate Social Networks , 2008 .

[14]  Sean R. Collins,et al.  Toward a Comprehensive Atlas of the Physical Interactome of Saccharomyces cerevisiae*S , 2007, Molecular & Cellular Proteomics.

[15]  Lada A. Adamic,et al.  Networks of strong ties , 2006, cond-mat/0605279.

[16]  T. S. Evans,et al.  Clique graphs and overlapping communities , 2010, ArXiv.

[17]  G. Karypis,et al.  Multilevel k-way hypergraph partitioning , 1999, Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361).

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

[19]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[20]  Boleslaw K. Szymanski,et al.  Overlapping community detection in networks: The state-of-the-art and comparative study , 2011, CSUR.

[21]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Coenraad Bron,et al.  Finding all cliques of an undirected graph , 1973 .

[23]  Ulrik Brandes,et al.  Advances in Social Network Analysis and Mining , 2009 .

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

[25]  Mason A. Porter,et al.  Comparing Community Structure to Characteristics in Online Collegiate Social Networks , 2008, SIAM Rev..

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

[27]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[28]  Hosung Park,et al.  What is Twitter, a social network or a news media? , 2010, WWW '10.

[29]  Fergal Reid,et al.  Partitioning Breaks Communities , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.

[30]  Jure Leskovec,et al.  Statistical properties of community structure in large social and information networks , 2008, WWW.

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

[32]  Fergal Reid,et al.  Title Detecting Highly Overlapping Community Structure by Greedy Clique Expansion Detecting Highly Overlapping Community Structure by Greedy Clique Expansion , 2022 .

[33]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[34]  Neil J. Hurley,et al.  Detecting Highly Overlapping Communities with Model-Based Overlapping Seed Expansion , 2010, ASONAM.

[35]  S. Borgatti,et al.  Analyzing Clique Overlap , 2009 .