Scalable Estimation and Two-Sample Testing for Large Networks via Subsampling
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3150484 (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 nonparametric two-sample hypothesis testing problem for random graphs
- A review of modern multiple hypothesis testing, with particular attention to the false discovery proportion
- A statistical interpretation of spectral embedding: the generalised random dot product graph
- A survey of statistical network models
- Consistency of community detection in networks under degree-corrected stochastic block models
- Latent Space Approaches to Social Network Analysis
- Multiple hypothesis testing in genomics
- Optimal Subsampling via Predictive Inference
- Optimal subsampling for large sample logistic regression
- Optimal subsampling for quantile regression in big data
- Random Dot Product Graph Models for Social Networks
- Statistical analysis of network data. Methods and models
- Subsampling bootstrap of count features of networks
- Subsampling sparse graphons under minimal assumptions
- The power grid as a complex network: a survey
- Two provably consistent divide-and-conquer clustering algorithms for large networks
- Universal rank inference via residual subsampling with application to large networks
Cited in
(2)
This page was built for publication: Scalable Estimation and Two-Sample Testing for Large Networks via Subsampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892348)
