Finding unique dense communities

Finding densely connected subgraphs, also called communities, in networks are of interest for many applications. In previous work, we showed an optimization method for efficiently finding subgraphs denser than the overall network [1]. This result is derived from our studies of network processes, dynamical processes that model interactions between individual agents in networks (i.e., spread of infection or cascading failures). In this paper, we prove that these subgraphs are also unique in the sense that there are no other subgraphs in the network isomorphic to these subgraphs.

[1]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[3]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[4]  Samir Khuller,et al.  On Finding Dense Subgraphs , 2009, ICALP.

[5]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .

[6]  Gabriela Hug,et al.  Multilevel distributed approach for DC Optimal Power Flow , 2015, 2015 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[7]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[8]  Charu C. Aggarwal,et al.  A Survey of Algorithms for Dense Subgraph Discovery , 2010, Managing and Mining Graph Data.

[9]  P. Van Mieghem,et al.  Epidemics in networks with nodal self-infection and the epidemic threshold. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

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

[12]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[13]  José M. F. Moura,et al.  Diffusion in Social Networks as SIS Epidemics: Beyond Full Mixing and Complete Graphs , 2014, IEEE Journal of Selected Topics in Signal Processing.

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

[15]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[16]  Nir Friedman,et al.  Probabilistic Graphical Models - Principles and Techniques , 2009 .

[17]  Rick Durrett,et al.  Some features of the spread of epidemics and information on a random graph , 2010, Proceedings of the National Academy of Sciences.

[18]  Jure Leskovec,et al.  Empirical comparison of algorithms for network community detection , 2010, WWW '10.

[19]  A. Hartmann.  Phase Transitions in Combinatorial Optimization Problems - Basics, Algorithms and Statistical Mechanics , 2005 .

[20]  José M. F. Moura,et al.  Role of subgraphs in epidemics over finite-size networks under the scaled SIS process , 2014, J. Complex Networks.