Paper detail

Mixing time upper bound for the uniformized Rosenthal walk on the special orthogonal groups

We prove that a uniformized variant of both the Rosenthal walk \cite{Rosenthal} and the Kac random walk \cite{Kac} on SO(n) mixes in $\cO(n^3)$ steps in total variation distance. The proof also extends easily to Rosenthal walk with fixed angle $θ\neq π$. To the best of our knowledge, this is the first polynomial time bound for both walks. The techniques employed are mainly from representation theory of SO(n). But a crucial new ingredient is the interpretation of the Fourier coefficients of the character ratio as counting the number of particle cascade paths arising from the classical branching rules.