The oriented Kesten--McKay law for random regular digraphs

RESUMO

We consider the adjacency matrix of a random directed $d$-regular graph on $N$ vertices. For fixed $d\geq 2$, we prove that the empirical eigenvalue density converges in probability to the oriented Kesten--McKay law as $N\to \infty$. The key technical input is the small-ball probability estimate for the smallest singular value. The proof combines a fixed-rank transposition argument with finite-field anticoncentration for shifted inverse compressions. We also prove a polynomial hard-edge estimate, which allows us to deduce the global law from the vanishing small-ball probability.