Random walks on the torus with several generators

dc.creatorPrescott, Timothy
dc.creatorSu, Francis Edward
dc.date2003-08-31
dc.date2004-04-27
dc.date.accessioned2026-07-07T05:00:43Z
dc.date.available2026-07-07T05:00:43Z
dc.descriptionOur 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 R^d/Z^d. 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.
dc.description10 pages; related work at http://www.math.hmc.edu/~su/papers.html
dc.identifierhttps://arxiv.org/abs/math/0309011
dc.identifierhttp://arxiv.org/abs/math/0309011
dc.identifierRandom Structures and Algorithms 25 (2004), 336-345.
dc.identifierdoi:10.1002/rsa.20029
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68427
dc.subjectProbability
dc.subject60B15; 11J13, 11K38
dc.titleRandom walks on the torus with several generators
dc.typetext

Files

Collections