On Diameter Based Community Structure Identification in Networks

Several community detection algorithms for large scale networks have been reported in the literature so far. But to the best of our knowledge none of these algorithms consider the diameter of the community as a key parameter. In this paper, we propose a new metric to measure the quality of the community structure identified in a network which is less computation intensive and more realistic. Also, we develop a new heuristic to identify community structures considering the diameter of the community as one of the determinant factors. To ensure good quality of the community structure, we restrict the diameter of a community, upper bounded by a certain value k ≪ D, the diameter of the original network. Comparison with existing algorithms by simulation on well-known graphs such as Zachary karate club, Dolphin network and Football club shows our algorithm performs better in terms of modularity of the community structure achieved. Also, it establishes the fact that the modularity parameter defined by us, can compare the community structures of a given network better.

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

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

[3]  David Lo,et al.  Hierarchical Parallel Algorithm for Modularity-Based Community Detection Using GPUs , 2013, Euro-Par.

[4]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[6]  David A. Bader,et al.  Parallel Community Detection for Massive Graphs , 2011, PPAM.

[7]  Anantharaman Kalyanaraman,et al.  Parallel Heuristics for Scalable Community Detection , 2014, 2014 IEEE International Parallel & Distributed Processing Symposium Workshops.

[8]  Rudolf Kruse,et al.  Online Community Detection by Using Nearest Hubs , 2016, ArXiv.

[9]  James Parker,et al.  on Knowledge and Data Engineering, , 1990 .

[10]  Yasuhiro Fujiwara,et al.  Real-Time Diameter Monitoring for Time-Evolving Graphs , 2011, DASFAA.

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

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

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

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

[15]  Mingwei Leng,et al.  A divisive spectral method for network community detection , 2015, ArXiv.

[16]  David Lusseau,et al.  The emergent properties of a dolphin social network , 2003, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[17]  Dafang Zhang,et al.  A GPU Based Fast Community Detection Implementation for Social Network , 2015, ICA3PP.

[18]  Ankur Narang,et al.  Fast Community Detection Algorithm with GPUs and Multicore Architectures , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[19]  Ulrik Brandes,et al.  On Modularity Clustering , 2008, IEEE Transactions on Knowledge and Data Engineering.