Subsampling bootstrap of count features of networks

Abstract

Analysis of stochastic models of networks is quite important in light of the huge influx of network data in social, information and bio sciences, but a proper statistical analysis of features of different stochastic models of networks is still underway. We propose bootstrap subsampling methods for finding empirical distribution of count features or ``moments'' (Bickel, Chen and Levina [Ann. Statist. 39 (2011) 2280-2301]) and smooth functions of these features for the networks. Using these methods, we cannot only estimate the variance of count features but also get good estimates of such feature counts, which are usually expensive to compute numerically in large networks. In our paper, we prove theoretical properties of the bootstrap estimates of variance of the count features as well as show their efficacy through simulation. We also use the method on some real network data for estimation of variance and expectation of some count features.

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

References in corpus (3)

• Modeling social networks from sampled data
• Graph limits and exchangeable random graphs
• The method of moments and degree distributions for network models

Cited by in corpus (10)

• One-Hot Graph Encoder Embedding
• Thirty Years of The Network Scale up Method
• Statistical inference for network samples using subgraph counts
• Variational Bayes model averaging for graphon functions and motif frequencies inference in W-graph models
• Using bootstrap for statistical inference on random graphs
• Bootstrapping Exchangeable Random Graphs
• Consistency of Maximum Likelihood for Continuous-Space Network Models I
• Contribution of directedness in graph spectra
• A Unified Framework for Community Detection and Model Selection in Blockmodels
• Econometric Models of Network Formation