Bootstrapping exchangeable random graphs

Citations Over Time

Abstract

We introduce two new bootstraps for exchangeable random graphs. One, the “empirical graphon bootstrap”, is based purely on resampling, while the other, the “histogram bootstrap”, is a model-based “sieve” bootstrap. We show that both of them accurately approximate the sampling distributions of motif densities, i.e., of the normalized counts of the number of times fixed subgraphs appear in the network. These densities characterize the distribution of (infinite) exchangeable networks. Our bootstraps therefore give a valid quantification of uncertainty in inferences about fundamental network statistics, and so of parameters identifiable from them.

Related Papers

• → Stochastic blockmodels: First steps(1983)2,778 cited
• → A nonparametric view of network models and Newman–Girvan and other modularities(2009)792 cited
• The method of moments and degree distributions for network models(2011)
• → Bootstrapping Networks with Latent Space Structure(2019)25 cited