Bootstrap-based statistical inference on the eigenvalues of weighted networks

DOI10.1007/S11222-025-10784-7MaRDI QIDQ6879389zbMATH OpenFDO

Authors Behzad Aalipur, Yichen Qin

Publication date 30 December 2025

Published in Statistics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11222-025-10784-7

zbMATH Keywords

graphonnetwork resamplingspectrumuncertainty

Mathematics Subject Classification ID

Bootstrap, jackknife and other resampling methods (62F40)

Cites work

• A nonparametric two-sample hypothesis testing problem for random graphs
• A nonparametric view of network models and Newman–Girvan and other modularities
• Bootstrapping exchangeable random graphs
• Edgeworth expansions for network moments
• Estimating network edge probabilities by neighbourhood smoothing
• Expander graphs and their applications
• Graph Spectra for Complex Networks
• Local bootstrap for network data
• Network cross-validation by edge sampling
• Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering
• Subsampling sparse graphons under minimal assumptions
• Universal rank inference via residual subsampling with application to large networks
• User-friendly tail bounds for sums of random matrices
• Using the bootstrap for statistical inference on random graphs

This page was built for publication: Bootstrap-based statistical inference on the eigenvalues of weighted networks

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