Bootstrapping exchangeable random graphs
From MaRDI portal
Publication:2136635
DOI10.1214/21-EJS1896zbMath1493.62147arXiv1711.00813MaRDI QIDQ2136635
Alden Green, Cosma Rohilla Shalizi
Publication date: 11 May 2022
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.00813
Nonparametric estimation (62G05) Random graphs (graph-theoretic aspects) (05C80) Bootstrap, jackknife and other resampling methods (62F40) Nonparametric statistical resampling methods (62G09)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Rate-optimal graphon estimation
- Consistency under sampling of exponential random graph models
- Oracle inequalities for network models and sparse graphon estimation
- The method of moments and degree distributions for network models
- Bootstrapping data arrays of arbitrary order
- Subsampling bootstrap of count features of networks
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Statistical analysis of network data. Methods and models
- Rate of convergence in the central limit theorem and in the strong law of large numbers for von Mises statistics
- The Berry-Esseen theorem for U-statistics
- Sufficient statistics and extreme points
- Resampling methods for dependent data
- Resampling and exchangeable arrays
- Optimal Estimation and Completion of Matrices with Biclustering Structures
- Counting Stars and Other Small Subgraphs in Sublinear-Time
- Very large graphs
- Approximately Counting Triangles in Sublinear Time
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- Asymptotics of Maximum Likelihood without the LLN or CLT or Sample Size Going to Infinity
- Probabilistic Symmetries and Invariance Principles
This page was built for publication: Bootstrapping exchangeable random graphs
