file.pdf (418.68 kB)
Download file

Co-clustering separately exchangeable network data

Download (418.68 kB)
journal contribution
posted on 01.01.2014, 00:00 by David ChoiDavid Choi, Patrick J. Wolfe

This article establishes the performance of stochastic blockmodels in addressing the co-clustering problem of partitioning a binary array into subsets, assuming only that the data are generated by a nonparametric process satisfying the condition of separate exchangeability. We provide oracle inequalities with rate of convergence OP(n−1/4) corresponding to profile likelihood maximization and mean-square error minimization, and show that the blockmodel can be interpreted in this setting as an optimal piecewise-constant approximation to the generative nonparametric model. We also show for large sample sizes that the detection of co-clusters in such data indicates with high probability the existence of co-clusters of equal size and asymptotically equivalent connectivity in the underlying generative process.

History

Publisher Statement

© Institute of Mathematical Statistics, 2014

Date

01/01/2014