Singularity of discrete random matrices

Abstract

Let be a non-constant real-valued random variable with finite support, and let Mn() denote an n× n random matrix with entries that are independent copies of . For which is not uniform on its support, we show that align* P[Mn() is singular] &= P[zero row or column] + (1+on(1))P[two equal (up to sign) rows or columns], align* thereby confirming a folklore conjecture. As special cases, we obtain: (1) For = Bernoulli(p) with fixed p ∈ (0,1/2), \[P[Mn() is singular] = 2n(1-p)n + (1+on(1))n(n-1)(p2 + (1-p)2)n,\] which determines the singularity probability to two asymptotic terms. Previously, no result of such precision was available in the study of the singularity of random matrices. (2) For = Bernoulli(p) with fixed p ∈ (1/2,1), \[P[Mn() is singular] = (1+on(1))n(n-1)(p2 + (1-p)2)n.\] Previously, only the much weaker upper bound of (p + on(1))n was known due to the work of Bourgain-Vu-Wood. For which is uniform on its support: (1) We show that align* P[Mn() is singular] &= (1+on(1))nP[two rows or columns are equal]. align* (2) Perhaps more importantly, we provide a sharp analysis of the contribution of the `compressible' part of the unit sphere to the lower tail of the smallest singular value of Mn().

0

Discussion (0)

Sign in to join the discussion.

Loading comments…