Stochastic blockmodels with growing number of classes

Details Stochastic blockmodels with growing number of classes Stochastic blockmodels with growing number of classes

2010-11-21

arxiv.org/abs/1011.4644v2

Mathematics

Statistics Theory

12 pages, 3 figures; revised version

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Stochastic blockmodels with growing number of classes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stochastic blockmodels with growing number of classes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stochastic blockmodels with growing number of classes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-221210