Mixing times of lozenge tiling and card shuffling Markov chains

Details Mixing times of lozenge tiling and card shuffling Markov chains Mixing times of lozenge tiling and card shuffling Markov chains

2001-02-26

arxiv.org/abs/math/0102193v2

Annals of Applied Probability, 14(1):274--325, 2004

Mathematics

Probability

39 pages, 8 figures

Scientific paper

We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application is to a class of Markov chains introduced by Luby, Randall, and Sinclair to generate random tilings of regions by lozenges. For an L X L region we bound the mixing time by O(L^4 log L), which improves on the previous bound of O(L^7), and we show the new bound to be essentially tight. In another application we resolve a few questions raised by Diaconis and Saloff-Coste, by lower bounding the mixing time of various card-shuffling Markov chains. Our lower bounds are within a constant factor of their upper bounds. When we use our methods to modify a path-coupling analysis of Bubley and Dyer, we obtain an O(n^3 log n) upper bound on the mixing time of the Karzanov-Khachiyan Markov chain for linear extensions.

Affiliated with

Also associated with

No associations

Rating

Mixing times of lozenge tiling and card shuffling Markov chains 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 Mixing times of lozenge tiling and card shuffling Markov chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mixing times of lozenge tiling and card shuffling Markov chains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-612510