Spectral measure for uniform $d$-regular digraphs
Abstract
Consider the matrix chosen uniformly at random from the finite set of all -dimensional matrices of zero main-diagonal and binary entries, having each row and column of sum to . That is, the adjacency matrix for the uniformly random -regular simple digraph . Fixing , it has long been conjectured that as the corresponding empirical eigenvalue distributions converge weakly, in probability, to an explicit non-random limit, %measure on , which is given by the Brown measure of the free sum of Haar unitary operators. We reduce this conjecture to bounding the decay in of the probability that the minimal singular value of the shifted matrix is very small. While the latter remains a challenging task, the required bound is comparable to the recently established control on the singularity of . The reduction is achieved here by sharp estimates on the behavior at large , near the real line, of the Green's function (aka resolvent) of the Hermitization of , which is of independent interest.
Cite
@article{arxiv.2310.14132,
title = {Spectral measure for uniform $d$-regular digraphs},
author = {Arka Adhikari and Amir Dembo},
journal= {arXiv preprint arXiv:2310.14132},
year = {2025}
}
Comments
63 pages