Random walks on the torus with several generators
Timothy Prescott, Francis Edward Su
Abstract
Our paper gives bounds for the rate of convergence for a class of random walks on the d-dimensional torus generated by a set of n vectors in Rd/Zd. We give bounds on the discrepancy distance from Haar measure; our lower bound holds for all such walks, and if the generators arise from the rows of a "badly approximable" matrix, then there is a corresponding upper bound. The bounds are sharp for walks on the circle.
Create a lesson
Related papers
A Khintchine type inequality for non-independent random variables
Jingyu Huang, Wenxuan Tao
Uniform-in-Time and Uniform-in-Temperature Particle Approximations of Coulomb MMD Flows
Junho Lee, Promit Ghosal
A clarification of Fermi's formula for the maximum of partial sums
Alessandro Lodi
Uniform-in-time propagation of chaos for singular Lk interaction kernels with rates
Nicoleta Cazacu, Alexandre Richard, Milica Tomasevic
Sharp Rogers--Shephard Inequalities for Rényi Entropy
Bang-Xian Han, Guoqing Zhan, Chiyu Zhou et al.
Maximum degree for random geometric graphs in the connectivity regime and beyond
Junpei Otsuka