DeepAI AI Chat
Log In Sign Up

Optimal Bipartite Network Clustering

by   Zhixin Zhou, et al.

We consider the problem of bipartite community detection in networks, or more generally the network biclustering problem. We present a fast two-stage procedure based on spectral initialization followed by the application of a pseudo-likelihood classifier twice. Under mild regularity conditions, we establish the weak consistency of the procedure (i.e., the convergence of the misclassification rate to zero) under a general bipartite stochastic block model. We show that the procedure is optimal in the sense that it achieves the optimal convergence rate that is achievable by a biclustering oracle, adaptively over the whole class, up to constants. The optimal rate we obtain sharpens some of the existing results and generalizes others to a wide regime of average degree growth. As a special case, we recover the known exact recovery threshold in the n regime of sparsity. To obtain the general consistency result, as part of the provable version of the algorithm, we introduce a sub-block partitioning scheme that is also computationally attractive, allowing for distributed implementation of the algorithm without sacrificing optimality. The provable version of the algorithm is derived from a general blueprint for pseudo-likelihood biclustering algorithms that employ simple EM type updates. We show the effectiveness of this general class by numerical simulations.


page 1

page 2

page 3

page 4


Improved clustering algorithms for the Bipartite Stochastic Block Model

We consider a Bipartite Stochastic Block Model (BSBM) on vertex sets V_1...

Fast Network Community Detection with Profile-Pseudo Likelihood Methods

The stochastic block model is one of the most studied network models for...

Analysis of spectral clustering algorithms for community detection: the general bipartite setting

We consider the analysis of spectral clustering algorithms for community...

Clustering Network Vertices in Sparse Contextual Multilayer Networks

We consider the problem of learning the latent community structure in a ...

Achieving Optimal Misclassification Proportion in Stochastic Block Model

Community detection is a fundamental statistical problem in network data...

Minimax Optimal Clustering of Bipartite Graphs with a Generalized Power Method

Clustering bipartite graphs is a fundamental task in network analysis. I...

Smooth tensor estimation with unknown permutations

We consider the problem of structured tensor denoising in the presence o...