Subsampling bootstrap of count features of networks

DOI10.1214/15-AOS1338zbMATH Open1326.62067arXiv1312.2645OpenAlexW3098811112MaRDI QIDQ892240FDOQ892240

S. Bhattacharyya, P. J. Bickel

Publication date: 18 November 2015

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

Abstract: Analysis of stochastic models of networks is quite important in light of the huge influx of network data in social, information and bio sciences, but a proper statistical analysis of features of different stochastic models of networks is still underway. We propose bootstrap subsampling methods for finding empirical distribution of count features or ``moments (Bickel, Chen and Levina [Ann. Statist. 39 (2011) 2280-2301]) and smooth functions of these features for the networks. Using these methods, we cannot only estimate the variance of count features but also get good estimates of such feature counts, which are usually expensive to compute numerically in large networks. In our paper, we prove theoretical properties of the bootstrap estimates of variance of the count features as well as show their efficacy through simulation. We also use the method on some real network data for estimation of variance and expectation of some count features.

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

zbMATH Keywords

bootstrapnetworkssubsamplingmodel-based samplingcount features

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (17)

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

   Recommendations

• Subsampling bootstrap in network DEA 👍 👎
• Estimating global subgraph counts by sampling 👍 👎
• Bootstrapping on undirected binary networks via statistical mechanics 👍 👎
• Testing for Equivalence of Network Distribution Using Subgraph Counts 👍 👎
• Using the bootstrap for statistical inference on random graphs 👍 👎
• Estimating the number of connected components in a graph via subgraph sampling 👍 👎
• Estimation of Subgraph Densities in Noisy Networks 👍 👎
• Sampling for Conditional Inference on Network Data 👍 👎
• Assessment of model fit via network comparison methods based on subgraph counts 👍 👎
• Subgraph counts in random graphs using incomplete U-statistics methods 👍 👎

This page was built for publication: Subsampling bootstrap of count features of networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892240)