What if CLIQUE were fast? Maximum Cliques in Information Networks and Strong Components in Temporal Networks

Exact maximum clique finders have progressed to the point where we can investigate cliques in million-node social and information networks, as well as find strongly connected components in temporal networks. We use one such finder to study a large collection of modern networks emanating from biological, social, and technological domains. We show inter-relationships between maximum cliques and several other common network properties, including network density, maximum core, and number of triangles. In temporal networks, we find that the largest temporal strong components have around 20-30% of the vertices of the entire network. These components represent groups of highly communicative individuals. In addition, we discuss and improve the performance and utility of the maximum clique finder itself.

[1]  Jacob Ratkiewicz,et al.  Political Polarization on Twitter , 2011, ICWSM.

[2]  Afonso Ferreira,et al.  On models and algorithms for dynamic communication networks : the case for evolving graphs † , 2007 .

[3]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..

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

[5]  Peter Druschel,et al.  Online social networks: measurement, analysis, and applications to distributed information systems , 2009 .

[6]  Subhash Khot,et al.  Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[7]  David F. Gleich,et al.  Tracking the random surfer: empirically measured teleportation parameters in PageRank , 2010, WWW '10.

[8]  Wei-keng Liao,et al.  Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs , 2012, WAW.

[9]  Afonso Ferreira,et al.  Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks , 2003, ADHOC-NOW.

[10]  David F. Gleich Graph of Flickr Photo-Sharing Social Network Crawled in May 2006 , 2012 .

[11]  Tore Opsahl Triadic closure in two-mode networks: Redefining the global and local clustering coefficients , 2013, Soc. Networks.

[12]  Alex Pentland,et al.  Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.

[13]  Jure Leskovec,et al.  Friendship and mobility: user movement in location-based social networks , 2011, KDD.

[14]  Ciro Cattuto,et al.  What's in a crowd? Analysis of face-to-face behavioral networks , 2010, Journal of theoretical biology.

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

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

[17]  Jon M. Kleinberg,et al.  Group formation in large social networks: membership, growth, and evolution , 2006, KDD '06.

[18]  Gergely Palla,et al.  Fundamental statistical features and self-similar properties of tagged networks , 2008, 0812.4236.

[19]  Azadeh Iranmehr,et al.  Trust Management for Semantic Web , 2009, 2009 Second International Conference on Computer and Electrical Engineering.

[20]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[21]  Jari Saramäki,et al.  Path lengths, correlations, and centrality in temporal networks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[23]  Krishna P. Gummadi,et al.  Measurement and analysis of online social networks , 2007, IMC '07.

[24]  Tore Opsahl,et al.  Clustering in weighted networks , 2009, Soc. Networks.

[25]  Mason A. Porter,et al.  Social Structure of Facebook Networks , 2011, ArXiv.

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

[27]  Cecilia Mascolo,et al.  Components in time-varying graphs , 2011, Chaos.

[28]  Ramana Rao Kompella,et al.  Time-based sampling of social network activity graphs , 2010, MLG '10.

[29]  Cecilia Mascolo,et al.  Characterising temporal distance and reachability in mobile and online social networks , 2010, CCRV.