Article contents
Recurrence and Transience for a Card Shuffling Model
Published online by Cambridge University Press: 12 September 2008
Abstract
A rule for shuffling an infinite deck of cards is considered where at each time step the first and jth card are interchanged with probability pj. Conditions are given under which this shuffling scheme, considered as a Markov chain on the space of permutations of integers, is recurrent or transient.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1995
References
- 4
- Cited by