Large corank of dense random regular digraphs

Source abstract

Let $1\le k\le n$ and let $A$ be the adjacency matrix of a uniformly random $d$-regular directed graph on $n$ vertices. Suppose that $λn\le d \le (1-λ)n$ for a fixed $0 0$ depending only on $λ$ such that $$\mathbb{P}[\operatorname{rank}(A)\le n-k]\le 2e^{-c_λ kn}.$$ This gives a large corank extension of the exponential singularity bound of Jain, Sah, and Sawhney.