Spectral measure for uniform d-regular digraphs

Abstract

Consider the matrix AG chosen uniformly at random from the finite set of all N-dimensional matrices of zero main-diagonal and binary entries, having each row and column of AG sum to d. That is, the adjacency matrix for the uniformly random d-regular simple digraph G. Fixing d 3, it has long been conjectured that as N ∞ the corresponding empirical eigenvalue distributions converge weakly, in probability, to an explicit non-random limit, %measure μd on C, which is given by the Brown measure of the free sum of d Haar unitary operators. We reduce this conjecture to bounding the decay in N of the probability that the minimal singular value of the shifted matrix A(w) = AG - 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 AG. The reduction is achieved here by sharp estimates on the behavior at large N, near the real line, of the Green's function (aka resolvent) of the Hermitization of A(w), which is of independent interest.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…