Subsampling bootstrap of count features of networks

DOI10.1214/15-AOS1338zbMath1326.62067arXiv1312.2645OpenAlexW3098811112MaRDI QIDQ892240

Sharmodeep Bhattacharyya, Peter J. Bickel

Publication date: 18 November 2015

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.2645

zbMATH Keywords

bootstrapnetworkssubsamplingmodel-based samplingcount features

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Bootstrap, jackknife and other resampling methods (62F40) Nonparametric statistical resampling methods (62G09)

Related Items

Edgeworth expansions for network moments, Bootstrapping exchangeable random graphs, Testing for Equivalence of Network Distribution Using Subgraph Counts, Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models, Thirty Years of The Network Scale-up Method, Subsampling bootstrap of count features of networks, Subsampling spectral clustering for stochastic block models in large-scale networks, Non-representative sampled networks: estimation of network structural properties by weighting, Bootstrap estimators for the tail-index and for the count statistics of graphex processes, Crawling subsampling for multivariate spatial autoregression model in large-scale networks, A motif building process for simulating random networks, Rejoinder on ``Data science, big data and statistics, Optimal adaptivity of signed-polygon statistics for network testing, Using the bootstrap for statistical inference on random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The method of moments and degree distributions for network models
• Subsampling bootstrap of count features of networks
• Modeling social networks from sampled data
• Statistical analysis of network data. Methods and models
• Representations for partially exchangeable arrays of random variables
• Bootstrap methods: another look at the jackknife
• Connected components in random graphs with given expected degree sequences
• A nonparametric view of network models and Newman–Girvan and other modularities
• Emergence of Scaling in Random Networks
• An Important Connection Between Network Motifs and Parsimony Models
• Graph limits and exchangeable random graphs
• Estimation and Prediction for Stochastic Blockstructures
• Latent Space Approaches to Social Network Analysis
• The phase transition in inhomogeneous random graphs
• Probabilistic Symmetries and Invariance Principles
• Sampling