Subsampling sparse graphons under minimal assumptions

DOI10.1093/BIOMET/ASAC032MaRDI QIDQ5879514zbMATH OpenOpenAlexWikidataFDO

Authors Robert Lunde, Purnamrita Sarkar

Publication date 1 March 2023

Published in Biometrika (Search for Journal in Brave)

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

zbMATH Keywords

eigenvaluenetworksparse graphonsubsamplingweak convergence

Mathematics Subject Classification ID

Statistics (62-XX)

Cited in

(17)

• Graph structured sparse subset selection
• Minimum fill-in of sparse graphs: kernelization and approximation
• On sparse subgraphs preserving connectivity properties
• Subsampling spectral clustering for stochastic block models in large-scale networks
• Subsampling Sparse Graphons Under Minimal Assumptions
• Bootstrap-based statistical inference on the eigenvalues of weighted networks
• Scalable Estimation and Two-Sample Testing for Large Networks via Subsampling
• Local bootstrap for network data
• Testing for the network small-world property
• Bootstrapping networks with latent space structure
• Subsampling-based modified Bayesian information criterion for large-scale stochastic block models
• Nonparametric two-sample hypothesis testing for low-rank random graphs of differing sizes
• A Bootstrap-based Method for Testing Similarity of Matched Networks
• An overview of asymptotic normality in stochastic blockmodels: cluster analysis and inference
• Higher-order graphon theory: fluctuations, degeneracies and inference
• Nonparametric inference for balance in signed networks
• A Unified Framework for Community Detection and Model Selection in Blockmodels

This page was built for publication: Subsampling sparse graphons under minimal assumptions

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