An Efficient homophilic model and Algorithms for Community Detection using Nash Dynamics

The problem of community detection is important as it helps in understanding the spread of information in a social network. All real complex networks have an inbuilt structure which captures and characterizes the network dynamics between its nodes. Linkages are more likely to form between similar nodes, leading to the formation of some community structure which characterizes the network dynamic. The more friends they have in common, the more the influence that each person can exercise on the other. We propose a disjoint community detection algorithm, $\textit{NashDisjoint}$ that detects disjoint communities in any given network. We evaluate the algorithm $\textit{NashDisjoint}$ on the standard LFR benchmarks, and we find that our algorithm works at least as good as that of the state of the art algorithms for the mixing factors less than 0.55 in all the cases. We propose an overlapping community detection algorithm $\textit{NashOverlap}$ to detect the overlapping communities in any given network. We evaluate the algorithm $\textit{NashOverlap}$ on the standard LFR benchmarks and we find that our algorithm works far better than the state of the art algorithms in around 152 different scenarios, generated by varying the number of nodes, mixing factor and overlapping membership. We run our algorithm $\textit{NashOverlap}$ on DBLP dataset to detect the large collaboration groups and found very interesting results. Also, these results of our algorithm on DBLP collaboration network are compared with the results of the $\textit{COPRA}$ algorithm and $\textit{OSLOM}$.

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

[2]  Xiaoming Liu,et al.  SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process , 2011, 2011 IEEE 11th International Conference on Data Mining Workshops.

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

[4]  S. Dongen.  Performance criteria for graph clustering and Markov cluster experiments , 2000 .

[5]  L. Shapley,et al.  Potential Games , 1994 .

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

[7]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[8]  R. Lathe.  Phd by thesis , 1988, Nature.

[9]  R. Guimerà,et al.  Functional cartography of complex metabolic networks , 2005, Nature.

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

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

[12]  Anca Andreica,et al.  Game Theory and Extremal Optimization for Community Detection in Complex Dynamic Networks , 2014, PloS one.

[13]  Martin Rosvall,et al.  An information-theoretic framework for resolving community structure in complex networks , 2007, Proceedings of the National Academy of Sciences.

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

[15]  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).

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

[17]  Filippo Menczer,et al.  Virality Prediction and Community Structure in Social Networks , 2013, Scientific Reports.

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

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

[20]  David M Blei,et al.  Efficient discovery of overlapping communities in massive networks , 2013, Proceedings of the National Academy of Sciences.

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

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

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

[24]  Wei Chen,et al.  A game-theoretic framework to identify overlapping communities in social networks , 2010, Data Mining and Knowledge Discovery.

[25]  Martin Rosvall,et al.  Compression of flow can reveal overlapping modular organization in networks , 2011, ArXiv.

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

[27]  M. Newman,et al.  Robustness of community structure in networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  Zengqiang Chen,et al.  Community detection based on local topological information in power grid , 2014, 2014 International Joint Conference on Neural Networks (IJCNN).

[29]  Ning Chen,et al.  Trial and error in influential social networks , 2013, KDD.

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

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