Videos

Strong convergence for random permutations

Presenter
May 17, 2018
Abstract
Benoît Collins - Kyoto University We show that given s1,…,sk k iid random permutations of the permutation Sn, they are asymptotically strongly free with high probability in the large n limit when seen as endomorphisms of the orthogonal of the Perron Frobenius vector in Cn. Time allowing, we will explain the interest of this result from the point of view of random graph theory, and give an outline of the proof, which relies on developing a non-commutative version of non-backtracking operators. This is joint work with Charles Bordenave.