Random walks with badly approximable numbers

Details Random walks with badly approximable numbers Random walks with badly approximable numbers

2001-02-27

arxiv.org/abs/math/0102206v1

DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 64 (2004), 95-101.

Mathematics

Probability

7 pages; to appear in DIMACS volume "Unusual Applications of Number Theory"; related work at http://www.math.hmc.edu/~su/paper

Scientific paper

Using the discrepancy metric, we analyze the rate of convergence of a random walk on the circle generated by d rotations, and establish sharp rates that show that badly approximable d-tuples in R^d give rise to walks with the fastest convergence. We use the discrepancy metric because the walk does not converge in total variation. For badly approximable d-tuples, the discrepancy is bounded above and below by (constant)k^(-d/2), where k is the number of steps in the random walk. We show how the constants depend on the d-tuple.

Affiliated with

Also associated with

No associations

Rating

Random walks with badly approximable numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random walks with badly approximable numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random walks with badly approximable numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-563442