Biased random-to-top shuffling

  title={Biased random-to-top shuffling},
  author={Johan Jonasson},
Recently Wilson [Ann. Appl. Probab. 14 (2004) 274–325] introduced an important new technique for lower bounding the mixing time of a Markov chain. In this paper we extend Wilson’s technique to find lower bounds of the correct order for card shuffling Markov chains where at each time step a random card is picked and put at the top of the deck. Two classes of such shuffles are addressed, one where the probability that a given card is picked at a given time step depends on its identity, the so… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 13 references

Mixing times of lozenge tiling and card shuffling Markov chains

  • D. B. Wilson
  • Ann. Appl. Probab
  • 2004
Highly Influential
13 Excerpts

Total variation lower bounds for Markov chains : Wilson ’ s lemma

  • L. Saloff-Coste
  • Random Walks and Geometry
  • 2004

Total variation lower bounds for Markov chains: Wilson’s lemma. In Random Walks and Geometry (V

  • L. Saloff-Coste
  • 2004
3 Excerpts

Convergence to stationarity for a Markov move-to-front scheme

  • E. Rodrigues
  • J. Appl. Probab
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…