Min-max communities in graphs: Complexity and computational properties

Community detection in graphs aims at identifying modules within a network and, possibly, their hierarchical organization by only using the information encoded in the graph modeling the network. Generally speaking, a community in a network is a subset of its nodes showing higher degree of interconnection with each other than to the remaining nodes. This is an informal characterization and different formal definitions of communities have been proposed in the literature, also in relation to the available information. For most such definitions, the problem of detecting a proper partition of the given network into a prefixed number of community is NP-hard.In this paper, we consider the case in which a weight is associated to each edge of the graph, measuring the amount of interconnection between the corresponding pair of nodes. Under this hypothesis, we introduce and explore a new definition of community, that is, min-max communities, to model highly connected sets of nodes: a min-max community is a set of vertices such that the weakest (minimal) relation inside the community is stronger than the strongest (maximal) relation outside. By analyzing the structural properties induced by this definition, we prove that the problem of partitioning a complete weighted graph into k 0 communities is tractable. We also show that a slight modification to this framework results into an NP-complete problem.

[1]  Zsolt Tuza,et al.  The satisfactory partition problem , 2006, Discret. Appl. Math..

[2]  Dennis Saleh.  Zs , 2001 .

[3]  A. James O’Malley,et al.  The analysis of social networks , 2008, Health Services and Outcomes Research Methodology.

[4]  John E. Hopcroft,et al.  Detecting the Structure of Social Networks Using (α, β)-Communities , 2011, WAW.

[5]  Michael Stiebitz.  Decomposing graphs under degree constraints , 1996 .

[6]  Jie Tang,et al.  Detecting Community Kernels in Large Social Networks , 2011, 2011 IEEE 11th International Conference on Data Mining.

[7]  Michael U. Gerber,et al.  Classes of graphs that can be partitioned to satisfy all their vertices. , 2004 .

[8]  Zsolt Tuza,et al.  On the Existence and Determination of Satisfactory Partitions in a Graph , 2003, ISAAC.

[9]  Robert E. Tarjan,et al.  Finding Strongly Knit Clusters in Social Networks , 2008, Internet Math..

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

[11]  S. Redner.  How popular is your paper? An empirical study of the citation distribution , 1998, cond-mat/9804163.

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

[13]  Robert E. Tarjan,et al.  Graph Clustering and Minimum Cut Trees , 2004, Internet Math..

[14]  Guy Melançon,et al.  Assessing the quality of multilevel graph clustering , 2013, Data Mining and Knowledge Discovery.

[15]  C. Lee Giles,et al.  Efficient identification of Web communities , 2000, KDD '00.

[16]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[17]  J. Kleinberg,et al.  Networks, Crowds, and Markets , 2010 .

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

[19]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[20]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[21]  A. Barabasi,et al.  Hierarchical Organization of Modularity in Metabolic Networks , 2002, Science.

[22]  R. Weiss,et al.  A Method for the Analysis of the Structure of Complex Organizations , 1955 .

[23]  Michael U. Gerber,et al.  Algorithmic approach to the satisfactory graph partitioning problem , 2000, Eur. J. Oper. Res..

[24]  Konstantinos Psounis,et al.  An analytical study of fundamental mobility properties for encounter-based protocols , 2008, Int. J. Auton. Adapt. Commun. Syst..

[25]  C. Lee Giles,et al.  Self-Organization and Identification of Web Communities , 2002, Computer.

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

[27]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[28]  Ronald D. Dutton,et al.  On satisfactory partitioning of graphs , 2002 .

[29]  E. Todeva.  Networks , 2007 .

[30]  Andrea E. F. Clementi,et al.  Distributed community detection in dynamic graphs , 2013, Theor. Comput. Sci..

[31]  Michael U. Gerber,et al.  Algorithms for vertex-partitioning problems on graphs with fixed clique-width , 2003, Theor. Comput. Sci..

[32]  Marcelo Dias de Amorim,et al.  The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing , 2009, IEEE INFOCOM 2009.

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

[34]  F. Luccio,et al.  On the Decomposition of Networks in Minimally Interconnected Subnetworks , 1969 .

[35]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations (Lecture Notes in Computer Science) , 2005 .

[36]  M. Newman,et al.  Identifying the role that animals play in their social networks , 2004, Proceedings of the Royal Society of London. Series B: Biological Sciences.