On the mixing time of Kac.s walk and other high-dimensional Gibbs samplers with constraints

Citation
S. Pillai, Natesh et Smith, Aaron, On the mixing time of Kac.s walk and other high-dimensional Gibbs samplers with constraints, Annals of probability (Online) , 46(4), 2018, pp. 2345-2399
ISSN journal
2168894X
Volume
46
Issue
4
Year of publication
2018
Pages
2345 - 2399
Database
ACNP
SICI code
Abstract
Determining the total variation mixing time of Kac.s random walk on the special orthogonal group SO(n) has been a long-standing open problem. In this paper, we construct a novel non-Markovian coupling for bounding this mixing time. The analysis of our coupling entails controlling the smallest singular value of a certain random matrix with highly dependent entries. The dependence of the entries in our matrix makes it not amenable to existing techniques in random matrix theory. To circumvent this difficulty, we extend some recent bounds on the smallest singular values of matrices with independent entries to our setting. These bounds imply that the mixing time of Kac.s walk on the group SO(n) is between C1n2 and C2n4log(n) for some explicit constants 0<C1,C2<., substantially improving on the bound of O(n5log(n)2) in the preprint of Jiang [Jiang (2012)]. Our methods may also be applied to other high dimensional Gibbs samplers with constraints, and thus are of independent interest. In addition to giving analytical bounds on the mixing time, our approach allows us to compute rigorous estimates of the mixing time by simulating the eigenvalues of a random matrix.