Convergence of the groups posterior distribution in latent or stochastic block models
arXiv:1206.7101 · doi:10.3150/13-BEJ579
Abstract
We propose a unified framework for studying both latent and stochastic block models, which are used to cluster simultaneously rows and columns of a data matrix. In this new framework, we study the behaviour of the groups posterior distribution, given the data. We characterize whether it is possible to asymptotically recover the actual groups on the rows and columns of the matrix, relying on a consistent estimate of the parameter. In other words, we establish sufficient conditions for the groups posterior distribution to converge (as the size of the data increases) to a Dirac mass located at the actual (random) groups configuration. In particular, we highlight some cases where the model assumes symmetries in the matrix of connection probabilities that prevents recovering the original groups. We also discuss the validity of these results when the proportion of non-null entries in the data matrix converges to zero.
Published at http://dx.doi.org/10.3150/13-BEJ579 in the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statistical Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm)
References in corpus (2)
Cited by in corpus (9)
- The random subgraph model for the analysis of an ecclesiastical network in Merovingian Gaul
- Profile Likelihood Biclustering
- Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model
- Block models for multipartite networks.Applications in ecology and ethnobiology
- A semiparametric extension of the stochastic block model for longitudinal networks
- Properties of Latent Variable Network Models
- Uncertainty quantification in the stochastic block model with an unknown number of classes
- Model Based Co-clustering of Mixed Numerical and Binary Data
- Goodness-of-fit Test for Latent Block Models