Probabilistic community detection with unknown number of communities
arXiv:1602.08062
Abstract
A fundamental problem in network analysis is clustering the nodes into groups which share a similar connectivity pattern. Existing algorithms for community detection assume the knowledge of the number of clusters or estimate it a priori using various selection criteria and subsequently estimate the community structure. Ignoring the uncertainty in the first stage may lead to erroneous clustering, particularly when the community structure is vague. We instead propose a coherent probabilistic framework for simultaneous estimation of the number of communities and the community structure, adapting recently developed Bayesian nonparametric techniques to network models. An efficient Markov chain Monte Carlo (MCMC) algorithm is proposed which obviates the need to perform reversible jump MCMC on the number of clusters. The methodology is shown to outperform recently developed community detection algorithms in a variety of synthetic data examples and in benchmark real-datasets. Using an appropriate metric on the space of all configurations, we develop non-asymptotic Bayes risk bounds even when the number of clusters is unknown. Enroute, we develop concentration properties of non-linear functions of Bernoulli random variables, which may be of independent interest.
References in corpus (9)
- Fast unfolding of communities in large networks
- Natural Scales in Geographical Patterns
- Finding community structure in networks using the eigenvectors of matrices
- Stochastic blockmodels and community structure in networks
- Bayesian variable selection with shrinking and diffusing priors
- Estimating the number of communities in a network
- Model selection and hypothesis testing for large-scale network models with overlapping groups
- Achieving Optimal Misclassification Proportion in Stochastic Block Model
- Estimating the number of communities in networks by spectral methods