A strong Nash stability based approach to minimum quasi clique partitioning

The problem of network partitioning into cohesive subgroups is of utmost interest in analysis of social networks. In this paper we use quasi clique based partitioning to study social cohesion. We propose a greedy algorithm based on the notion of strong Nash stability to determine the cohesive subgroups in a network. Through experimental results we show that the proposed algorithm yields promising results by identifying meaningful, compact and dense clusters in many real life social network data sets.

[1]  Falk Schreiber,et al.  Wiley Series on Bioinformatics: Computational Techniques and Engineering , 2008 .

[2]  Sandra Sudarsky,et al.  Massive Quasi-Clique Detection , 2002, LATIN.

[3]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[4]  Takeaki Uno,et al.  An Efficient Algorithm for Enumerating Pseudo Cliques , 2007, ISAAC.

[5]  Charalampos E. Tsourakakis,et al.  Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees , 2013, KDD.

[6]  Mehmet Karakaya,et al.  Hedonic coalition formation games: A new stability notion , 2011, Math. Soc. Sci..

[7]  Jian Pei,et al.  On mining cross-graph quasi-cliques , 2005, KDD '05.

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

[9]  Tuomas Sandholm,et al.  On the complexity of strong Nash equilibrium: Hard-to-solve instances and smoothed complexity , 2013, ArXiv.

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

[11]  Mauro Brunato,et al.  On Effectively Finding Maximal Quasi-cliques in Graphs , 2008, LION.

[12]  Sergiy Butenko,et al.  Clique Relaxation Models in Social Network Analysis , 2012 .

[13]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[14]  P. Erdös,et al.  The Representation of a Graph by Set Intersections , 1966, Canadian Journal of Mathematics.

[15]  Matthew O. Jackson,et al.  The Stability of Hedonic Coalition Structures , 2002, Games Econ. Behav..

[16]  Y. Narahari,et al.  A game theory inspired, decentralized, local information based algorithm for community detection in social graphs , 2012, Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012).