The Annals of Applied Probability

On the rate of mixing for $p$-shuffles

Steven P. Lalley

Full-text: Open access

Abstract

The p-shuffle is a natural generalization of the dovetail shuffle. It is defined as follows. First, the deck is cut into a top stack and a bottom stack so that the distribution of the size of the top stack is Binomial $(N, p)$, where $N$ is the total number of cards in the deck.Then, conditional on the outcome of the cut,the two stacks are “riffled” in such a way that all possible riffles (interleavings) of these two stacks are equally likely. The main result of the paper is an asymptotic $(N \to \infty)$ bound on the number of repetitions needed to “randomize” the deck.

Article information

Source
Ann. Appl. Probab., Volume 10, Number 4 (2000), 1302-1321.

Dates
First available in Project Euclid: 22 April 2002

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1019487618

Digital Object Identifier
doi:10.1214/aoap/1019487618

Mathematical Reviews number (MathSciNet)
MR1810876

Zentralblatt MATH identifier
1073.60535

Subjects
Primary: 60C05: Combinatorial probability
Secondary: 60B15: Probability measures on groups or semigroups, Fourier transforms, factorization 20B30: Symmetric groups

Keywords
Riffle shuffle cutoff phenomenon

Citation

Lalley, Steven P. On the rate of mixing for $p$-shuffles. Ann. Appl. Probab. 10 (2000), no. 4, 1302--1321. doi:10.1214/aoap/1019487618. https://projecteuclid.org/euclid.aoap/1019487618


Export citation

References

  • [1] Aldous, D. (1983). Random walks on finite groups and rapidly mixing Markov chains. Seminar on Probability XVII. Lecture Notes in Math. 986 243-297. Springer, Berlin.
  • [2] Aldous, D. and Diaconis, P. (1987). Strong uniform times and finite random walks. Adv. in Appl. Math. 8 69-97.
  • [3] Bayer, D. and Diaconis, P. (1992). Trailing the dovetail shuffle to its lair. Ann. Appl. Probab. 2 294-313.
  • [4] Bidigare, P., Hanlon, P. and Rockmore, D. (1999). A combinatorial description of the spectrum of the Tsetlin library and its generalization to hyperplane arrangments. Duke Math. J. 99 135-174.
  • [5] Brown, K. and Diaconis, P. (1998). Random walks and hyperplane arrangements. Ann. Probab. 26 1813-1854.
  • [6] Diaconis, P. (1998). Group Representation in Probablity and Statistics. IMS, Hayward, CA.
  • [7] Diaconis, P., Fill, J. and Pitman, J. (1992). Analysis of top to random shuffles. Combin. Probab. Comput. 1 135-155.
  • [8] Fulman, J. (1998). The combinatorics of biased riffle shuffles. Combinatorica 18 173-184.