The Maximum Community Partition Problem in Networks

We proposed a community structure detection problem which aims to analyze the relationships among the data via the network topology. We collect a series of unified definitions for community structures and formulate the community structure detection into a combinatorial optimization problem to identify as many communities as possible for a given network. For some well known community definitions, we prove that there is no polynomial time optimal solution for this maximum partition problem unless P = NP, and we develop a heuristic algorithm based on greedy strategy for it. The experimental results on many real networks show that the proposed algorithm is effective in terms of the number of valid communities and the modularity score.

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

[2]  Donald E. Knuth.  The Stanford GraphBase: a platform for combinatorial algorithms , 1993, SODA '93.

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

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

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

[6]  Neo D. Martinez.  Artifacts or Attributes? Effects of Resolution on the Little Rock Lake Food Web , 1991 .

[7]  Bin Wu,et al.  Detecting Communities in Massive Networks Based on Local Community Attractive Force Optimization , 2010, 2010 International Conference on Advances in Social Networks Analysis and Mining.

[8]  Robert R. Christian,et al.  Organizing and understanding a winter's seagrass foodweb network through effective trophic levels , 1999 .

[9]  Xiang-Sun Zhang,et al.  A combinatorial model and algorithm for globally searching community structure in complex networks , 2010, Journal of Combinatorial Optimization.

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

[11]  Bradford A. Hawkins,et al.  EFFECTS OF SAMPLING EFFORT ON CHARACTERIZATION OF FOOD-WEB STRUCTURE , 1999 .

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

[13]  J. Roughgarden,et al.  Construction and Analysis of a Large Caribbean Food Web , 1993 .

[14]  Peng Zhang,et al.  Comparative definition of community and corresponding identifying algorithm. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[17]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[18]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[19]  V. Voloshin.  Introduction to Graph and Hypergraph Theory , 2013 .

[20]  M. Huxham,et al.  Do Parasites Reduce the Chances of Triangulation in a Real Food Web , 1996 .