An absorbing version of the top-to-random shuffle

DOI10.2140/involve.2024.17.603MaRDI QIDQ6631532

Mehr Rai, Joel Brewster Lewis

Publication date: 1 November 2024

Published in: Involve (Search for Journal in Brave)

zbMATH Keywords

finite Markov chaintop-to-random shuffle

Mathematics Subject Classification ID

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

Cites Work

• A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
• Shuffling Cards and Stopping Times
• Analysis of Top To Random Shuffles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An absorbing version of the top-to-random shuffle