Using the bootstrap for statistical inference on random graphs
From MaRDI portal
Abstract: In this paper, we propose new nonparametric approach to network inference that may be viewed as a fusion of block sampling procedures for temporally and spatially dependent processes with the classical network methodology. We develop estimation and uncertainty quantification procedures for network mean degree using a "patchwork" sample and nonparametric bootstrap, under the assumption of unknown degree distribution. We investigate asymptotic properties of the proposed patchwork bootstrap procedure and present cross-validation methodology for selecting an optimal patch size. We validate the new patchwork bootstrap on simulated networks with short and long tailed mean degree distributions, and revisit the Erdos collaboration data to illustrate the proposed methodology.
Recommendations
Cites work
- A critical point for random graphs with a given degree sequence
- A nonparametric view of network models and Newman–Girvan and other modularities
- Bootstrap methods: another look at the jackknife
- Bootstrapping on undirected binary networks via statistical mechanics
- Bootstraps for time series
- Critical behavior in inhomogeneous random graphs
- Evolution of the social network of scientific collaborations
- scientific article; zbMATH DE number 1226876 (Why is no real title available?)
- scientific article; zbMATH DE number 775750 (Why is no real title available?)
- Limit theorems for a random graph epidemic model
- Limits of dense graph sequences
- Modeling social networks from sampled data
- On blocking rules for the bootstrap with dependent data
- On the bias of traceroute sampling
- Power-law distributions in empirical data
- Statistical analysis of network data. Methods and models
- Subsampling bootstrap of count features of networks
- Survey sampling in graphs
- The asymptotic number of labeled graphs with given degree sequences
- The impact of bootstrap methods on time series analysis
- The method of moments and degree distributions for network models
Cited in
(17)- Network cross-validation by edge sampling
- Edgeworth expansions for network moments
- Bootstrap inference for network vector autoregression in large-scale social network
- Bootstrapping exchangeable random graphs
- 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
- Bias reduction in the population size estimation of large data sets
- Large multiple graphical model inference via bootstrap
- Sampling for conditional inference on network data
- A conversation with Mary E. Thompson
- Bootstrap-based statistical inference on the eigenvalues of weighted networks
- Local bootstrap for network data
- Subsampling-based modified Bayesian information criterion for large-scale stochastic block models
- Nonparametric inference for balance in signed networks
- Bootstrap methods for the empirical study of decision-making and information flows in social systems
- Subsampling bootstrap of count features of networks
This page was built for publication: Using the bootstrap for statistical inference on random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5507344)
