Rank deficiency of random matrices
Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

TL;DR
This paper investigates the probability that a large random Bernoulli matrix has a corank of at least k, revealing an exponential decay rate in the matrix size.
Contribution
It establishes the asymptotic probability decay rate for the corank of large random Bernoulli matrices, a novel result in random matrix theory.
Findings
Probability that corank ≥ k decays exponentially with matrix size
Explicit asymptotic decay rate of -k for the probability
Provides insight into the rank deficiency behavior of Bernoulli matrices
Abstract
Let be a random matrix with i.i.d. entries. We show that for fixed , \[\lim_{n\to \infty}\frac{1}{n}\log_2\mathbb{P}[\text{corank }M_n\ge k] = -k.\]
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
