paper-with-me

홈 › Papers

Testing for latent structure via the Wilcoxon--Wigner random matrix of normalized rank statistics

2025-12-21 · Jonquil Z. Liao, Joshua Cape arxiv

This paper considers the problem of testing for latent structure in large symmetric data matrices. The goal here is to develop statistically principled methodology that is flexible in its applicability, computationally efficient, and insensitive to extreme data variation, thereby overcoming limitations facing existing approaches. To do so, we introduce and systematically study certain symmetric matrices, called Wilcoxon--Wigner random matrices, whose entries are normalized rank statistics derived from an underlying independent and identically distributed sample of absolutely continuous random variables. These matrices naturally arise as the matricization of one-sample problems in statistics and conceptually lie at the interface of nonparametrics, multivariate analysis, and data reduction. Among our results, we establish that the leading eigenvalue and corresponding eigenvector of Wilcoxon--Wigner random matrices admit asymptotically Gaussian fluctuations with explicit centering and scaling terms. These asymptotic results enable rigorous parameter-free and distribution-free spectral methodology for addressing two hypothesis testing problems, namely community detection and principal submatrix detection. Numerical examples illustrate the performance of the proposed approach. Throughout, our findings are juxtaposed with existing results based on the spectral properties of independent entry symmetric random matrices in signal-plus-noise data settings.

📄 PDF Abstract BibTeX arXiv:2512.18924

Code (0)

등록된 구현이 없습니다.

Tasks

Community Detection

Similar Papers 제목 키워드 기반

Spectral Phase Transition and Optimal PCA in Block-Structured Spiked models

2024-03-06 · Pierre Mergny, Justin Ko, Florent Krzakala

We discuss the inhomogeneous spiked Wigner model, a theoretical framework recently introduced to study structured noise in various learning scenarios, through the prism of random matrix theory, with a specific focus on i…

Robust random graph matching in Gaussian models via vector approximate message passing

2024-12-21 · Zhangsong Li

In this paper, we focus on the matching recovery problem between a pair of correlated Gaussian Wigner matrices with a latent vertex correspondence. We are particularly interested in a robust version of this problem such …

Graph Matching

A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation

2023-06-01 · Jian Ding, Zhangsong Li

We propose an efficient algorithm for matching two correlated Erd\H{o}s--R\'enyi graphs with $n$ vertices whose edges are correlated through a latent vertex correspondence. When the edge density $q= n^{- \alpha+o(1)}$ fo…

Graph Matching

Beyond Random Matrix Theory for Deep Networks

2020-06-13 · Diego Granziol

We investigate whether the Wigner semi-circle and Marcenko-Pastur distributions, often used for deep neural network theoretical analysis, match empirically observed spectral densities. We find that even allowing for outl…

Stochastic weight matrix dynamics during learning and Dyson Brownian motion

2024-07-23 · Gert Aarts, Biagio Lucini, Chanju Park

We demonstrate that the update of weight matrices in learning algorithms can be described in the framework of Dyson Brownian motion, thereby inheriting many features of random matrix theory. We relate the level of stocha…