Statistical Mechanics of Semi-Supervised Clustering in Sparse Graphs

Abstract

We theoretically study semi-supervised clustering in sparse graphs in the presence of pairwise constraints on the cluster assignments of nodes. We focus on bi-cluster graphs, and study the impact of semi-supervision for varying constraint density and overlap between the clusters. Recent results for unsupervised clustering in sparse graphs indicate that there is a critical ratio of within-cluster and between-cluster connectivities below which clusters cannot be recovered with better than random accuracy. The goal of this paper is to examine the impact of pairwise constraints on the clustering accuracy. Our results suggests that the addition of constraints does not provide automatic improvement over the unsupervised case. When the density of the constraints is sufficiently small, their only impact is to shift the detection threshold while preserving the criticality. Conversely, if the density of (hard) constraints is above the percolation threshold, the criticality is suppressed and the detection threshold disappears.

8 pages, 4 figures

References in corpus (17)

• Modularity and community structure in networks
• Community detection in graphs
• Resolution limit in community detection
• Statistical Mechanics of Community Detection
• The performance of modularity maximization in practical contexts
• Mixture models and exploratory analysis in networks
• Robustness of community structure in networks
• A Bayesian Approach to Network Modularity
• Community Detection as an Inference Problem
• Statistical significance of communities in networks
• When are networks truly modular?
• Cascading Dynamics in Modular Networks
• (Un)detectable cluster structure in sparse networks
• Organization of modular networks
• Modular networks emerge from multiconstraint optimization
• Community Detection with and without Prior Information
• Communication and correlation among communities