Bootstrapping Exchangeable Random Graphs
arXiv:1711.00813 · doi:10.1214/21-EJS1896
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.
References in corpus (13)
- Mapping change in large networks
- Rate-optimal graphon estimation
- The method of moments and degree distributions for network models
- Nonparametric graphon estimation
- Consistency under sampling of exponential random graph models
- An theory of sparse graph convergence I: limits, sparse random graph models, and power law distributions
- Optimal Estimation and Completion of Matrices with Biclustering Structures
- Subsampling bootstrap of count features of networks
- Bootstrapping data arrays of arbitrary order
- Bootstrapping Networks with Latent Space Structure
- Blockmodels: A R-package for estimating in Latent Block Model and Stochastic Block Model, with various probability functions, with or without covariates
- Rates of Convergence of Spectral Methods for Graphon Estimation
- Inference for graphs and networks: Extending classical tools to modern data
Cited by in corpus (5)
- Bootstrapping Networks with Latent Space Structure
- On the Theoretical Properties of the Network Jackknife
- Estimating Graph Dimension with Cross-validated Eigenvalues
- Dynamic Silos: Increased Modularity in Intra-organizational Communication Networks during the Covid-19 Pandemic
- Trading off Accuracy for Speedup: Multiplier Bootstraps for Subgraph Counts