Mixture Models and Networks -- Overview of Stochastic Blockmodelling
arXiv:2005.09396
Abstract
Mixture models are probabilistic models aimed at uncovering and representing latent subgroups within a population. In the realm of network data analysis, the latent subgroups of nodes are typically identified by their connectivity behaviour, with nodes behaving similarly belonging to the same community. In this context, mixture modelling is pursued through stochastic blockmodelling. We consider stochastic blockmodels and some of their variants and extensions from a mixture modelling perspective. We also survey some of the main classes of estimation methods available, and propose an alternative approach. In addition to the discussion of inferential properties and estimating procedures, we focus on the application of the models to several real-world network datasets, showcasing the advantages and pitfalls of different approaches.
arXiv comment23 pages, 5 figures
References in corpus (11)
- Emergence of scaling in random networks
- Natural Scales in Geographical Patterns
- Stochastic blockmodels and community structure in networks
- Model-based Clustering
- Uncovering latent structure in valued graphs: A variational approach
- Nonparametric Bayesian inference of the microcanonical stochastic block model
- Network histograms and universality of blockmodel approximation
- Stochastic blockmodel approximation of a graphon: Theory and consistent estimation
- Efficient method for estimating the number of communities in a network
- Mixtures of Experts Models
- Blockmodels: A R-package for estimating in Latent Block Model and Stochastic Block Model, with various probability functions, with or without covariates