The characteristic polynomial of sums of random permutations and regular digraphs
From MaRDI portal
Abstract: Let be the sum of permutations matrices of size , each drawn uniformly at random and independently. We prove that the normalized characteristic polynomial converges when towards a random analytic function on the unit disk. As an application, we obtain an elementary proof of the spectral gap of random regular digraphs. Our results are valid both in the regime where is fixed and for slowly growing with .
This page was built for publication: The characteristic polynomial of sums of random permutations and regular digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6395418)