Random regular digraphs: singularity and spectrum
Random regular digraphs: singularity and spectrum

Nicholas Cook , UCLA
Fine Hall 214
Please note special day (Tuesday). We consider two random matrix ensembles associated to large random regular digraphs: (1) the 0/1 adjacency matrix, and (2) the adjacency matrix with iid bounded edge weights. Motivated by universality conjectures, we show that the spectral distribution for the latter ensemble is asymptotically described by the circular law, assuming the graph has degree linear in the number of vertices. Towards establishing the same result for the unweighted adjacency matrix, we prove that it is invertible with high probability, even for sparse digraphs with degree growing only polylogarithmically.