title: Detecting alternative graph clusterings.
abstract: The problem of graph clustering or community detection has enjoyed a lot of attention in complex networks literature. A quality function, modularity, quantifies the strength of clustering and on maximization yields sensible partitions. However, in most real world networks, there are an exponentially large number of near-optimal partitions with some being very different from each other. Therefore, picking an optimal clustering among the alternatives does not provide complete information about network topology. To tackle this problem, we propose a graph perturbation scheme which can be used to identify an ensemble of near-optimal and diverse clusterings. We establish analytical properties of modularity function under the perturbation which ensures diversity. Our approach is algorithm independent and therefore can leverage any of the existing modularity maximizing algorithms. We numerically show that our methodology can systematically identify very different partitions on several existing data sets. The knowledge of diverse partitions sheds more light into the topological organization and helps gain a more complete understanding of the underlying complex network.
authors.affiliation: Industrial Engineering Department, Pennsylvania State University, University Park, PA 16802, USA.
authors.forename: Supreet
authors.initials: S
authors.lastname: Mandala
authors.forename: Soundar
authors.initials: S
authors.lastname: Kumara
authors.forename: Tao
authors.initials: T
authors.lastname: Yao
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D008962:Models, Theoretical