A Method Based on Total Variation for Network Modularity Optimization Using the MBO Scheme

The study of network structure is pervasive in sociology, biology, computer science, and many other disciplines. One of the most important areas of network science is the algorithmic detection of cohesive groups of nodes called "communities". One popular approach to find communities is to maximize a quality function known as {\em modularity} to achieve some sort of optimal clustering of nodes. In this paper, we interpret the modularity function from a novel perspective: we reformulate modularity optimization as a minimization problem of an energy functional that consists of a total variation term and an $\ell_2$ balance term. By employing numerical techniques from image processing and $\ell_1$ compressive sensing -- such as convex splitting and the Merriman-Bence-Osher (MBO) scheme -- we develop a variational algorithm for the minimization problem. We present our computational results using both synthetic benchmark networks and real data.

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

[2]  D. Mumford,et al.  Optimal approximations by piecewise smooth functions and associated variational problems , 1989 .

[3]  S. Esedoglu,et al.  Threshold dynamics for the piecewise constant Mumford-Shah functional , 2006 .

[4]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[5]  G. D. Maso,et al.  An Introduction to-convergence , 1993 .

[6]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Amanda L. Traud,et al.  Community Structure in Congressional Cosponsorship Networks , 2007, 0708.1191.

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

[9]  Deanna Needell,et al.  Stable Image Reconstruction Using Total Variation Minimization , 2012, SIAM J. Imaging Sci..

[10]  Christopher R. Anderson,et al.  A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices , 2010, J. Comput. Phys..

[11]  Vladimir Batagelj,et al.  Generalized blockmodeling , 2005, Structural analysis in the social sciences.

[12]  L. Evans.  Convergence of an algorithm for mean curvature motion , 1993 .

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

[14]  Arjuna Flenner,et al.  Multiclass Data Segmentation Using Diffuse Interface Methods on Graphs , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Xavier Bresson,et al.  Multi-class Transductive Learning Based on ℓ1 Relaxations of Cheeger Cut and Mumford-Shah-Potts Model , 2013, Journal of Mathematical Imaging and Vision.

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

[17]  M. Newman.  The physics of networks , 2008 .

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

[19]  Matthias Hein,et al.  Constrained 1-Spectral Clustering , 2012, AISTATS.

[20]  Xavier Bresson,et al.  Total Variation, Cheeger Cuts , 2010, ICML.

[21]  P. Mucha,et al.  Spectral tripartitioning of networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Robert V. Kohn,et al.  Local minimisers and singular perturbations , 1989, Proceedings of the Royal Society of Edinburgh: Section A Mathematics.

[23]  R. Guimerà,et al.  Modularity from fluctuations in random graphs and complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Benjamin H. Good,et al.  Performance of modularity maximization in practical contexts. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[26]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[27]  Arjuna Flenner,et al.  Diffuse Interface Models on Graphs for Classification of High Dimensional Data , 2012, Multiscale Model. Simul..

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

[29]  R. Lambiotte,et al.  Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks , 2008, IEEE Transactions on Network Science and Engineering.

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

[31]  D. J. Eyre,et al.  An Unconditionally Stable One-Step Scheme for Gradient Systems , 1997 .

[32]  Stefan Boettcher,et al.  Optimization with Extremal Dynamics , 2000, Complex..

[33]  Mason A. Porter,et al.  Social Structure of Facebook Networks , 2011, ArXiv.

[34]  S. Osher,et al.  Motion of multiple junctions: a level set approach , 1994 .

[35]  A. Bertozzi,et al.  AN MBO SCHEME ON GRAPHS FOR SEGMENTATION AND IMAGE PROCESSING , 2012 .

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

[37]  Felix Otto,et al.  Threshold Dynamics for Networks with Arbitrary Surface Tensions , 2015 .

[38]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

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

[40]  Mason A. Porter,et al.  Core-Periphery Structure in Networks , 2012, SIAM J. Appl. Math..

[41]  J. Reichardt,et al.  Statistical mechanics of community detection. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[42]  Charlotte M. Deane,et al.  The function of communities in protein interaction networks at multiple scales , 2009, BMC Systems Biology.

[43]  Matthias Hein,et al.  Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts , 2011, NIPS.

[44]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[45]  G. Barles,et al.  A Simple Proof of Convergence for an Approximation Scheme for Computing Motions by Mean Curvature , 1995 .

[46]  M. Newman,et al.  Mixing Patterns and Community Structure in Networks , 2002, cond-mat/0210146.

[47]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[48]  Paul Van Dooren,et al.  Extracting spatial information from networks with low-order eigenvectors , 2011, ArXiv.

[49]  Arthur D. Szlam,et al.  A Total Variation-based Graph Clustering Algorithm for Cheeger Ratio Cuts , 2009 .

[50]  Stéphane Lafon,et al.  Diffusion maps , 2006 .

[51]  Tony F. Chan,et al.  Active contours without edges , 2001, IEEE Trans. Image Process..

[52]  M. Lustig,et al.  Compressed Sensing MRI , 2008, IEEE Signal Processing Magazine.

[53]  Mason A. Porter,et al.  Communities in Networks , 2009, ArXiv.

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

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

[56]  W. Marsden.  I and J , 2012 .

[57]  Matthias Hein,et al.  An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA , 2010, NIPS.

[58]  Andrea L. Bertozzi,et al.  An MBO Scheme on Graphs for Classification and Image Processing , 2013, SIAM J. Imaging Sci..

[59]  Xavier Bresson,et al.  Convergence and Energy Landscape for Cheeger Cut Clustering , 2012, NIPS.

[60]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

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

[62]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[63]  B. Vollmayr-Lee,et al.  Fast and accurate coarsening simulation with an unconditionally stable time step. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[64]  A. Bertozzi,et al.  $\Gamma$-convergence of graph Ginzburg-Landau functionals , 2012, Advances in Differential Equations.

[65]  Arjuna Flenner,et al.  Fast Multiclass Segmentation using Diffuse Interface Methods on Graphs , 2013 .