Bootstrapping exchangeable random graphs
From MaRDI portal
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.
Recommendations
Cites work
- An L^p theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- Approximately counting triangles in sublinear time
- Asymptotics of maximum likelihood without the LLN or CLT or sample size going to infinity
- Bootstrapping data arrays of arbitrary order
- Consistency under sampling of exponential random graph models
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Counting stars and other small subgraphs in sublinear-time
- scientific article; zbMATH DE number 3862208 (Why is no real title available?)
- scientific article; zbMATH DE number 1057566 (Why is no real title available?)
- Optimal estimation and completion of matrices with biclustering structures
- Oracle inequalities for network models and sparse graphon estimation
- Probabilistic Symmetries and Invariance Principles
- Rate of convergence in the central limit theorem and in the strong law of large numbers for von Mises statistics
- Rate-optimal graphon estimation
- Resampling and exchangeable arrays
- Resampling methods for dependent data
- Statistical analysis of network data. Methods and models
- Subsampling bootstrap of count features of networks
- Sufficient statistics and extreme points
- The Berry-Esseen theorem for U-statistics
- The method of moments and degree distributions for network models
- Very large graphs
Cited in
(13)- Bootstrap estimators for the tail-index and for the count statistics of graphex processes
- Using the bootstrap for statistical inference on random graphs
- Estimation of Subgraph Densities in Noisy Networks
- Bootstrap-based statistical inference on the eigenvalues of weighted networks
- Local bootstrap for network data
- Testing for the network small-world property
- Bootstrapping networks with latent space structure
- Subsampling-based modified Bayesian information criterion for large-scale stochastic block models
- Higher-Order Accurate Two-Sample Network Inference and Network Hashing
- A Bootstrap-based Method for Testing Similarity of Matched Networks
- An overview of asymptotic normality in stochastic blockmodels: cluster analysis and inference
- Higher-order graphon theory: fluctuations, degeneracies and inference
- Nonparametric inference for balance in signed networks
This page was built for publication: Bootstrapping exchangeable random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136635)
