Stochastic blockmodels with growing number of classes

11/21/2010
by   David S. Choi, et al.
0

We present asymptotic and finite-sample results on the use of stochastic blockmodels for the analysis of network data. We show that the fraction of misclassified network nodes converges in probability to zero under maximum likelihood fitting when the number of classes is allowed to grow as the root of the network size and the average network degree grows at least poly-logarithmically in this size. We also establish finite-sample confidence bounds on maximum-likelihood blockmodel parameter estimates from data comprising independent Bernoulli random variates; these results hold uniformly over class assignment. We provide simulations verifying the conditions sufficient for our results, and conclude by fitting a logit parameterization of a stochastic blockmodel with covariates to a network data example comprising a collection of Facebook profiles, resulting in block estimates that reveal residual structure.

READ FULL TEXT
research
12/29/2017

Finite-sample risk bounds for maximum likelihood estimation with arbitrary penalties

The MDL two-part coding index of resolvability provides a finite-sampl...
research
11/23/2022

Faster Stochastic First-Order Method for Maximum-Likelihood Quantum State Tomography

In maximum-likelihood quantum state tomography, both the sample size and...
research
03/11/2019

Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model

We consider a dynamic version of the stochastic block model, in which th...
research
04/26/2020

Maximum Likelihood Estimation of Stochastic Frontier Models with Endogeneity

We provide a closed-form maximum likelihood estimation of stochastic fro...
research
08/27/2020

Efficient closed-form estimation of large spatial autoregressions

Newton-step approximations to pseudo maximum likelihood estimates of spa...
research
11/06/2017

Consistency of Maximum Likelihood for Continuous-Space Network Models

Network analysis needs tools to infer distributions over graphs of arbit...
research
06/17/2021

Entrywise limit theorems of eigenvectors and their one-step refinement for sparse random graphs

We establish finite-sample Berry-Esseen theorems for the entrywise limit...

Please sign up or login with your details

Forgot password? Click here to reset