The method of moments and degree distributions for network models

Abstract

Probability models on graphs are becoming increasingly important in many applications, but statistical tools for fitting such models are not yet well developed. Here we propose a general method of moments approach that can be used to fit a large class of probability models through empirical counts of certain patterns in a graph. We establish some general asymptotic properties of empirical graph moments and prove consistency of the estimates as the graph size grows for all ranges of the average degree including $\Omega (1)$. Additional results are obtained for the important special case of degree distributions.

Published in at http://dx.doi.org/10.1214/11-AOS904 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (3)

• Finding community structure in networks using the eigenvectors of matrices
• Stochastic blockmodels and community structure in networks
• Modeling homophily and stochastic equivalence in symmetric relational data