Oriented Kesten–McKay law conjecture for random regular digraphs

From papers

Fix an integer d3d\ge 3, and let An(d)A^{(d)}_n be uniformly drawn from the set An,d\mathcal{A}_{n,d} of adjacency matrices of dd-regular directed graphs on nn vertices. Let μAn(d)\mu_{A^{(d)}_n} denote its empirical spectral distribution, and let μKM(d)\mu^{(d)}_{\mathrm{KM}} be the oriented Kesten–McKay law on C\mathbb{C} with density

fKM(d)(z)=1πd2(d1)(d2z2)21{zd}f^{(d)}_{\mathrm{KM}}(z)=\frac{1}{\pi}\frac{d^2(d-1)}{(d^2-|z|^2)^2}\mathbf{1}_{\{|z|\le\sqrt d\}}

with respect to Lebesgue measure. Oriented Kesten–McKay law conjecture. As nn\to\infty, μAn(d)μKM(d)\mu_{A^{(d)}_n}\to\mu^{(d)}_{\mathrm{KM}} in probability. For fixed degree, this predicts the limiting empirical spectral distribution of random regular digraph adjacency matrices; the source calls it well known but provides no resolution in the supplied text.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Nicholas A. Cook, “The circular law for random regular digraphs”, arXiv:1703.05839 (2017).

Solutions 0

No solutions have been posted yet.