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

Abstract

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.

23 pages

References in corpus (7)

• Fast unfolding of communities in large networks
• Finding community structure in networks using the eigenvectors of matrices
• Benchmark graphs for testing community detection algorithms
• Statistical Mechanics of Community Detection
• Community Structure in Congressional Cosponsorship Networks
• Fast and Accurate Coarsening Simulation with an Unconditionally Stable Time Step
• Spectral tripartitioning of networks