Author:
Diaconis Persi,Fill James Allen,Pitman Jim
Abstract
A deck of n cards is shuffled by repeatedly taking off the top m cards and inserting them in random positions. We give a closed form expression for the distribution after any number of steps. This is used to give the asymptotics of the approach to stationarity: for m fixed and n large, it takes shuffles to get close to random. The formulae lead to new subalgebras in the group algebra of the symmetric group.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference16 articles.
1. Shuffling Cards and Stopping Times
2. A Mackey formula in the group ring of a Coxeter group
3. Strong Stationary Times Via a New Form of Duality
4. [5] Diaconis P. , Hanlon P. and Rockmore D. (1991) The eigenvalues of Markov chains on permutations. Unpublished manuscript.
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献