Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-17T16:06:18.246Z Has data issue: false hasContentIssue false
  • English
  • Français

Recurrence and Transience for a Card Shuffling Model

Published online by Cambridge University Press:  12 September 2008

Gregory F. Lawler
Gregory F. Lawler
Affiliation:
Department of Mathematics, Duke University, Box 90320, Durham, NC 27708–0320, USA
Get access Rights & Permissions [Opens in a new window]

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
Combinatorics, Probability and Computing , Volume 4 , Issue 2 , June 1995 , pp. 133 - 142
Copyright
Copyright © Cambridge University Press 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Diaconis, P. (1988) Applications of Non-Commutative Fourier Analysis to Probability Problems. Lecture Notes in Mathematics, vol. 1362, Springer-Verlag, 51–100.Google Scholar
[2]Diaconis, P and Shahshahani, M. (1981) Generating a Random Permutation with Random Transpositions. Z. Wahr. verw. Geb. 57 159–180.CrossRefGoogle Scholar
[3]Wanding, D. and Lawler, G. To appear.Google Scholar
[4]Liggett, T. (1985) Interacting Particle Systems. Springer-Verlag.CrossRefGoogle Scholar