Recurrence and Transience for a Card Shuffling Model

DOI10.1017/S096354830000153XzbMath0837.60062OpenAlexW2033076731MaRDI QIDQ4852429

Gregory F. Lawler

Publication date: 20 May 1996

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096354830000153x

zbMATH Keywords

Markov chainsrecurrence and transience

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Related Items (4)

Spectral properties of a class of random walks on locally finite groups ⋮ On a class of Markov semigroups on discrete ultra-metric spaces ⋮ On transience of card shuffling ⋮ Oscillating heat kernels on ultrametric spaces

Cites Work

• Generating a random permutation with random transpositions

This page was built for publication: Recurrence and Transience for a Card Shuffling Model