Accelerating Abelian Random Walks with Hyperbolic Dynamics

preprint2022arXivOpen access

Abstract

Given integers d≥2,n≥1d \geq 2, n \geq 1, we consider affine random walks on torii (Z/nZ)d(\mathbb{Z} / n \mathbb{Z})^{d} defined as Xt+1=AXt+Btmod  nX_{t+1} = A X_{t} + B_{t} \mod n, where A∈GLd(Z)A \in \mathrm{GL}_{d}(\mathbb{Z}) is an invertible matrix with integer entries and (Bt)t≥0(B_{t})_{t \geq 0} is a sequence of iid random increments on Zd\mathbb{Z}^{d}. We show that when AA has no eigenvalues of modulus 11, this random walk mixes in O(log⁡nlog⁡log⁡n)O(\log n \log \log n) steps as n→∞n \rightarrow \infty, and mixes actually in O(log⁡n)O(\log n) steps only for almost all nn. These results generalize those on the so-called Chung-Diaconis-Graham process, which corresponds to the case d=1d=1. Our proof is based on the initial arguments of Chung, Diaconis and Graham, and relies extensively on the properties of the dynamical system x↦A⊤xx \mapsto A^{\top} x on the continuous torus Rd/Zd\mathbb{R}^{d} / \mathbb{Z}^{d}. Having no eigenvalue of modulus one makes this dynamical system a hyperbolic toral automorphism, a typical example of a chaotic system known to have a rich behaviour. As such our proof sheds new light on the speed-up gained by applying a deterministic map to a Markov chain.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.