The characteristic polynomial of sums of random permutations and regular digraphs

Abstract

Let An be the sum of d permutation matrices of size n× n, each drawn uniformly at random and independently. We prove that the normalized characteristic polynomial 1d(In - z An/d) converges when n ∞ 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 d is fixed and for d slowly growing with n.

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…