A deck of n cards is shuffled by repeatedly moving the top card to one of the bottom kn positions uniformly at random. We give upper and lower bounds on the total variation mixing time for this shuffle as kn ranges from a constant to n. We also consider a symmetric variant of this shuffle in which at each step either the top card is randomly inserted into the bottom kn positions or a random card from the bottom kn positions is moved to the top. For this reversible shuffle we derive bounds on the L2 mixing time. Finally, we transfer mixing time estimates for the above shuffles to the lazy top to bottom-k walks that move with probability 1/2 at each step.
References
Aldous, D. (1983). Random walks on finite groups and rapidly mixing Markov chains. Séminaire de Probabilités XVII. Lecture Notes in Math. 986 243–297. Springer, Berlin. MR770418 Aldous, D. (1983). Random walks on finite groups and rapidly mixing Markov chains. Séminaire de Probabilités XVII. Lecture Notes in Math. 986 243–297. Springer, Berlin. MR770418
Diaconis, P. (1988). Group Representations in Probability and Statistics. IMS, Hayward, CA. MR964069 0695.60012 Diaconis, P. (1988). Group Representations in Probability and Statistics. IMS, Hayward, CA. MR964069 0695.60012
Diaconis, P., Fill, J. and Pitman, J. (1992). Analysis of top to random shuffles. Combin. Probab. Comput. 1 135–155. MR1179244 0798.60008 10.1017/S0963548300000158 Diaconis, P., Fill, J. and Pitman, J. (1992). Analysis of top to random shuffles. Combin. Probab. Comput. 1 135–155. MR1179244 0798.60008 10.1017/S0963548300000158
Diaconis, P. and Saloff-Coste, L. (1993). Comparison techniques for random walk on finite groups. Ann. Probab. 21 2131–2156. MR1245303 0790.60011 10.1214/aop/1176989013 euclid.aop/1176989013 Diaconis, P. and Saloff-Coste, L. (1993). Comparison techniques for random walk on finite groups. Ann. Probab. 21 2131–2156. MR1245303 0790.60011 10.1214/aop/1176989013 euclid.aop/1176989013
Diaconis, P. and Saloff-Coste, L. (1993). Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3 696–730. MR1233621 0799.60058 10.1214/aoap/1177005359 euclid.aoap/1177005359 Diaconis, P. and Saloff-Coste, L. (1993). Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3 696–730. MR1233621 0799.60058 10.1214/aoap/1177005359 euclid.aoap/1177005359
Diaconis, P. and Saloff-Coste, L. (1995). Random walks on finite groups: A survey of analytic techniques. In Probability Measures on Groups and Related Structures 11 (Z. H. Heyer, ed.) 44–75. World Scientific, River Edge, NJ. MR1414925 0918.60059 Diaconis, P. and Saloff-Coste, L. (1995). Random walks on finite groups: A survey of analytic techniques. In Probability Measures on Groups and Related Structures 11 (Z. H. Heyer, ed.) 44–75. World Scientific, River Edge, NJ. MR1414925 0918.60059
Diaconis, P. and Shahshahani, M. (1981). Generating a random permutation with random transposition. Z. Wahrsch. Verw. Gebiete 57 159–179. MR626813 0485.60006 10.1007/BF00535487 Diaconis, P. and Shahshahani, M. (1981). Generating a random permutation with random transposition. Z. Wahrsch. Verw. Gebiete 57 159–179. MR626813 0485.60006 10.1007/BF00535487
Diaconis, P. and Stroock, D. (1991). Geometric bounds for eigenvalues for Markov chains. Ann. Appl. Probab. 1 36–61. MR1097463 0731.60061 10.1214/aoap/1177005980 euclid.aoap/1177005980 Diaconis, P. and Stroock, D. (1991). Geometric bounds for eigenvalues for Markov chains. Ann. Appl. Probab. 1 36–61. MR1097463 0731.60061 10.1214/aoap/1177005980 euclid.aoap/1177005980
Jonasson, J. (2005). Biased random-to-top shuffling. Preprint. 1126.60009 10.1214/10505160600000097 euclid.aoap/1151592258 Jonasson, J. (2005). Biased random-to-top shuffling. Preprint. 1126.60009 10.1214/10505160600000097 euclid.aoap/1151592258
Saloff-Coste, L. (1996). Lectures on finite Markov chains. Lectures on Probability Theory and Statistics. Ecole d'Eté de Probabiltés de Saint-Flour XXVI. Lecture Notes in Math. 1665 301–413. Springer, Berlin. MR1490046 10.1007/BFb0092617 Saloff-Coste, L. (1996). Lectures on finite Markov chains. Lectures on Probability Theory and Statistics. Ecole d'Eté de Probabiltés de Saint-Flour XXVI. Lecture Notes in Math. 1665 301–413. Springer, Berlin. MR1490046 10.1007/BFb0092617
Saloff-Coste, L. (2004). Random walks on finite groups. In Probability on Discrete Structures (H. Kesten, ed.). Encyclopaedia of Mathematical Sciences 110 263–346. Springer, Berlin. MR2023654 1049.60006 Saloff-Coste, L. (2004). Random walks on finite groups. In Probability on Discrete Structures (H. Kesten, ed.). Encyclopaedia of Mathematical Sciences 110 263–346. Springer, Berlin. MR2023654 1049.60006
Saloff-Coste, L. (2004). Total variation lower bounds for finite Markov chains: Wilson's lemma. In Random Walks and Geometry 515–532. de Gruyter, Berlin. MR2087800 1067.60066 Saloff-Coste, L. (2004). Total variation lower bounds for finite Markov chains: Wilson's lemma. In Random Walks and Geometry 515–532. de Gruyter, Berlin. MR2087800 1067.60066
Wilmer, E. (2003). A local limit theorem for a family of non-reversible Markov chains. J. Theoret. Probab. 16 751–770. MR2009201 1030.60065 10.1023/A:1025628701453 Wilmer, E. (2003). A local limit theorem for a family of non-reversible Markov chains. J. Theoret. Probab. 16 751–770. MR2009201 1030.60065 10.1023/A:1025628701453
Wilson, D. B. (2003). Mixing time of the Rudvalis shuffle. Electron. Comm. Probab. 8 77–85. MR1987096 1061.60074 10.1214/ECP.v8-1071 euclid.ecp/1463608892 Wilson, D. B. (2003). Mixing time of the Rudvalis shuffle. Electron. Comm. Probab. 8 77–85. MR1987096 1061.60074 10.1214/ECP.v8-1071 euclid.ecp/1463608892
Wilson, D. B. (2004). Mixing times of lozenge tiling and card shuffling Markov chains. Ann. Appl. Probab. 14 274–325. MR2023023 1040.60063 10.1214/aoap/1075828054 euclid.aoap/1075828054 Wilson, D. B. (2004). Mixing times of lozenge tiling and card shuffling Markov chains. Ann. Appl. Probab. 14 274–325. MR2023023 1040.60063 10.1214/aoap/1075828054 euclid.aoap/1075828054
