Kac’s walk on n-sphere mixes in n log n steps

DSpace/Manakin Repository

Kac’s walk on n-sphere mixes in n log n steps

Citable link to this page


Title: Kac’s walk on n-sphere mixes in n log n steps
Author: Pillai, Natesh S; Smith, Aaron

Note: Order does not necessarily reflect citation order of authors.

Citation: Pillai, Natesh S., and Aaron Smith. "Kac’s walk on n-sphere mixes in n log n steps." The Annals of Applied Probability 27, no. 1 (2017): 631-650.
Full Text & Related Files:
Abstract: Determining the mixing time of Kac's random walk on the sphere Sn−1 is a long-standing open problem. We show that the total variation mixing time of Kac's walk on Sn−1 is between 12nlog(n) and 200nlog(n). Our bound is thus optimal up to a constant factor, improving on the best-known upper bound of O(n5log(n)2) due to Jiang. Our main tool is a `non-Markovian' coupling recently introduced by the second author for obtaining the convergence rates of certain high dimensional Gibbs samplers in continuous state spaces.
Published Version: https://projecteuclid.org/euclid.aoap/1488790837
Other Sources: https://arxiv.org/abs/1507.08554
Terms of Use: This article is made available under the terms and conditions applicable to Open Access Policy Articles, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#OAP
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:34390103
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search