Extreme least singular values of random row submatrices with bounded-density subgaussian entries
Xiufan Yang, Shu Wen, Yitzchak Shmalo
Abstract
Let ξ be a centered real subgaussian random variable with positive variance and a bounded Lebesgue density, and let Am∈RNm× m have independent entries distributed as ξ, where Nm/mγ>1. For each set I⊂[Nm] with |I|=m, let (Am)I denote the row submatrix indexed by I, and define Mm(Am):=I⊂[Nm],\,|I|=mσ((Am)I). We determine its exponential scale: 1m Mm(Am)P-h(γ), where h(γ):=γγ-(γ-1)(γ-1). This extends the corresponding real Gaussian result. The main new ingredient is an upper-tail argument that avoids uniform control over exponentially many random hyperplanes. We combine a density-level local central limit theorem for delocalized directions, an averaged delocalization estimate for hyperplane normals, an exponential bound for nearly parallel pairs, and amplification using a linear number of independent probe rows. For every fixed ∈(0,h(γ)), the probability of an -deviation is at most C(-cm) for all sufficiently large m. Under the canonical coupling induced by a single infinite i.i.d. array, this summable deviation estimate yields a uniform almost-sure exponential law over every compact range of aspect ratios. In particular, at the real phase-retrieval threshold Nm=2m-1, the Balan--Wang stability parameter has exponential base 1/4 in probability and, under this coupling, almost surely.
Create a lesson
Related papers
A pathwise Ito formula for weakly differentiable functions
Anna Ananova, Rama Cont
Unified framework for asymptotically uniform iterative construction of generalised random graphs with local constraints
Ivan Kryven, Rik Versendaal, Mike de Vries
Negative association of Busemann functions in exponential last-passage percolation
Erik Bates, Xiao Shen
Limit Points of Reflow with Minibatch Optimal Transport
Antonin Chambolle, Johannes Hertrich
Sharp asymptotics for the tree-completion time in cylindrical Hastings--Levitov(0)
Xiao-Ming Fu, Tianyang Sun, Yuxuan Zong
Pairwise edge correlations in random minimum spanning trees: a universal bound and complete-graph negative correlation
Anish Gupta