On transience of card shuffling

On transience of card shuffling
HTML articles powered by AMS MathViewer

by Sara Brofferio and Wolfgang Woess PDF

Proc. Amer. Math. Soc. 129 (2001), 1513-1519 Request permission

We present simple proofs of transience/recurrence for certain card shuffling models, that is, random walks on the infinite symmetric group.

References

D. A. Darling and P. Erdős, On the recurrence of a certain chain, Proc. Amer. Math. Soc. 19 (1968), 336–338. MR 222962, DOI 10.1090/S0002-9939-1968-0222962-X
Persi Diaconis, Group representations in probability and statistics, Institute of Mathematical Statistics Lecture Notes—Monograph Series, vol. 11, Institute of Mathematical Statistics, Hayward, CA, 1988. MR 964069
Persi Diaconis and Laurent Saloff-Coste, Comparison techniques for random walk on finite groups, Ann. Probab. 21 (1993), no. 4, 2131–2156. MR 1245303
Leopold Flatto and Joel Pitt, Recurrence criteria for random walks on countable Abelian groups, Illinois J. Math. 18 (1974), 1–19. MR 341616
Gregory F. Lawler, Recurrence and transience for a card shuffling model, Combin. Probab. Comput. 4 (1995), no. 2, 133–142. MR 1342857, DOI 10.1017/S096354830000153X
Terry Lyons, A simple criterion for transience of a reversible Markov chain, Ann. Probab. 11 (1983), no. 2, 393–402. MR 690136
C. St. J. A. Nash-Williams, Random walk and electric currents in networks, Proc. Cambridge Philos. Soc. 55 (1959), 181–194. MR 124932, DOI 10.1017/s0305004100033879
Wolfgang Woess, Random walks on infinite graphs and groups—a survey on selected topics, Bull. London Math. Soc. 26 (1994), no. 1, 1–60. MR 1246471, DOI 10.1112/blms/26.1.1
Maretsugu Yamasaki, Discrete potentials on an infinite network, Mem. Fac. Sci. Shimane Univ. 13 (1979), 31–44. MR 558311