ÍâÍøÌìÌÃ

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 poly-logarithmically.