Circular law for sparse random regular digraphs

Alexander Litvak, Anna Lytova, Konstantin Tikhomirov +2

Fix a constant $C\ge 1$ and let $d=d(n)$ satisfy $d\le {\ln }^{C}n$ for every large integer $n$. Denote by $A_n$ the adjacency matrix of a uniform random directed $d$-regular graph…