A Bootstrap-based Method for Testing Similarity of Matched Networks
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 4213240 (Why is no real title available?)
- scientific article; zbMATH DE number 472938 (Why is no real title available?)
- scientific article; zbMATH DE number 1104922 (Why is no real title available?)
- A Block Model for Node Popularity in Networks with Community Structure
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- A Scalable Bootstrap for Massive Data
- A nonparametric two-sample hypothesis testing problem for random graphs
- A simple bootstrap method for constructing nonparametric confidence bands for functions
- Achieving optimal misclassification proportion in stochastic block models
- Bootstrap methods: another look at the jackknife
- Bootstrapping Lasso estimators
- Bootstrapping exchangeable random graphs
- Collective dynamics of `small-world' networks
- Community detection in degree-corrected block models
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistent community detection in multi-relational data through restricted multi-layer stochastic blockmodel
- Discussion of “Statistical methods for network surveillance”
- Edgeworth expansions for network moments
- Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals
- Hypothesis testing for network data in functional neuroimaging
- Latent Space Approaches to Social Network Analysis
- Latent space models for multiplex networks with shared structure
- On the asymptotic accuracy of Efron's bootstrap
- Optimization via low-rank approximation for community detection in networks
- Random Dot Product Graph Models for Social Networks
- Resampling methods for dependent data
- Scalable Estimation and Two-Sample Testing for Large Networks via Subsampling
- Scalable estimation of epidemic thresholds via node sampling
- Scalable resampling in massive generalized linear models via subsampled residual bootstrap
- Scalable subsampling: computation, aggregation and inference
- Spectral clustering and the high-dimensional stochastic blockmodel
- Spectral clustering in heterogeneous networks
- Spectral distances of graphs
- Statistical methods for network surveillance
- Subsampling based community detection for large networks
- Subsampling bootstrap of count features of networks
- Subsampling sparse graphons under minimal assumptions
- Testing for the network small-world property
- The average distances in random graphs with given expected degrees
- The dependent random weighting
- The jackknife and bootstrap
- Two provably consistent divide-and-conquer clustering algorithms for large networks
- Two-sample hypothesis testing for inhomogeneous random graphs
- Two-sample test of stochastic block models
- Variational Bayesian inference for the latent position cluster model for network data
This page was built for publication: A Bootstrap-based Method for Testing Similarity of Matched Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238208)
