Oriented Kesten–McKay law conjecture for random regular digraphs
Oriented Kesten–McKay law conjecture for random regular digraphs
Fix an integer , and let be uniformly drawn from the set of adjacency matrices of -regular directed graphs on vertices. Let denote its empirical spectral distribution, and let be the oriented Kesten–McKay law on with density
with respect to Lebesgue measure. Oriented Kesten–McKay law conjecture. As , 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
Sign in to submit a solution.
No solutions have been posted yet.