Rank deficiency of Bernoulli random matrices for growing corank

2026/07/01 by Zeyan Song, Hanchao Wang
Mathematics · #math.PR

paper · pdf

Abstract

Let A be an n x n Bernoulli random matrix whose entries are i.i.d. Bernoulli(p) random variables. In this paper, we determine the probability that the corank of A is at least k when k is of order o(sqrt(log n)): P(corank A >= k) = (1-p+o_n(1))^(kn).

Related

• Rank deficiency of random matrices
• Rank of Sparse Bernoulli Matrices
• On random matrices with large corank
• Sharp invertibility of random Bernoulli matrices
• Singularity of sparse Bernoulli matrices