Universal rank inference via residual subsampling with application to large networks

DOI10.1214/23-AOS2282arXiv1912.11583MaRDI QIDQ6136584FDOQ6136584

Yingying Fan, Qing Yang, Xiao Han

Publication date: 31 August 2023

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: Determining the precise rank is an important problem in many large-scale applications with matrix data exploiting low-rank plus noise models. In this paper, we suggest a universal approach to rank inference via residual subsampling (RIRS) for testing and estimating rank in a wide family of models, including many popularly used network models such as the degree corrected mixed membership model as a special case. Our procedure constructs a test statistic via subsampling entries of the residual matrix after extracting the spiked components. The test statistic converges in distribution to the standard normal under the null hypothesis, and diverges to infinity with asymptotic probability one under the alternative hypothesis. The effectiveness of RIRS procedure is justified theoretically, utilizing the asymptotic expansions of eigenvectors and eigenvalues for large random matrices recently developed in Fan et al. (2019a) and Fan et al. (2019b). The advantages of the newly suggested procedure are demonstrated through several simulation and real data examples.

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

zbMATH Keywords

eigenvaluesrobustnesseigenvectorsasymptotic expansionshigh dimensionalitylarge random matriceslow-rank modelsrank inference

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Asymptotic properties of parametric estimators (62F12) Random matrices (probabilistic aspects) (60B20) Robustness and adaptive procedures (parametric inference) (62F35)

Cites Work

• Title not available (Why is that?)
• Likelihood-based model selection for stochastic block models
• Network cross-validation by edge sampling
• Network Cross-Validation for Determining the Number of Communities in Network Data
• Consistency of community detection in networks under degree-corrected stochastic block models
• Matrix estimation by universal singular value thresholding
• Mixed membership stochastic blockmodels
• Community Detection and Stochastic Block Models
• Stochastic Blockmodels for Directed Graphs
• Variational Bayesian inference and complexity control for stochastic block models
• Hypothesis Testing for Automated Community Detection in Networks
• A goodness-of-fit test for stochastic block models
• Estimating the number of communities by spectral methods
• Improved Bayesian inference for the stochastic block model with application to large networks
• Optimal adaptivity of signed-polygon statistics for network testing
• Simple: Statistical Inference on Membership Profiles in Large Networks
• Asymptotic Theory of Eigenvectors for Random Matrices With Diverging Spikes
• Central limit theorems for eigenvalues in a spiked population model
• Singular vector and singular subspace distribution for the matrix denoising model
• Universal rank inference via residual subsampling with application to large networks

Cited In (1)

• Universal rank inference via residual subsampling with application to large networks

This page was built for publication: Universal rank inference via residual subsampling with application to large networks

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