English

Spectral measure for uniform $d$-regular digraphs

Probability 2025-07-31 v2 Combinatorics

Abstract

Consider the matrix AGA_{\mathcal{G}} chosen uniformly at random from the finite set of all NN-dimensional matrices of zero main-diagonal and binary entries, having each row and column of AGA_{\mathcal{G}} sum to dd. That is, the adjacency matrix for the uniformly random dd-regular simple digraph G\mathcal{G}. Fixing d3d \ge 3, it has long been conjectured that as NN \to \infty the corresponding empirical eigenvalue distributions converge weakly, in probability, to an explicit non-random limit, %measure μd\mu_d on C\mathbb{C}, which is given by the Brown measure of the free sum of dd Haar unitary operators. We reduce this conjecture to bounding the decay in NN of the probability that the minimal singular value of the shifted matrix A(w)=AGwIA(w) = A_{\mathcal{G}} - w I is very small. While the latter remains a challenging task, the required bound is comparable to the recently established control on the singularity of AGA_{\mathcal{G}}. The reduction is achieved here by sharp estimates on the behavior at large NN, near the real line, of the Green's function (aka resolvent) of the Hermitization of A(w)A(w), which is of independent interest.

Keywords

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

R2 v1 2026-06-28T12:57:48.710Z