A discrete probability problem in card shuffling

DOI10.1080/03610926.2013.834451MaRDI QIDQ2807709zbMATH OpenOpenAlexFDO

Authors M. Bhaskara Rao, Haimeng Zhang, Chunfeng Huang, Fu-Chih Cheng

Publication date 25 May 2016

Published in Communications in Statistics. Theory and Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610926.2013.834451

zbMATH Keywords

Markov chainscard shufflingrecurrence relationdiscrete probability

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Recommendations

• On a problem in shuffling
• How many times are needed for card shuffling?
• scientific article; zbMATH DE number 953298
• Riffle shuffles of decks with repeated cards
• Trailing the dovetail shuffle to its lair

Cites work

• scientific article; zbMATH DE number 3854137 (Why is no real title available?)
• Counting permutations by their rigid patterns
• Statistical problems involving permutations with restricted positions
• Two-sided Eulerian numbers via balls in boxes

Cited in

(2)

• scientific article; zbMATH DE number 1408150 (Why is no real title available?)
• Card shuffling and Diophantine approximation

This page was built for publication: A discrete probability problem in card shuffling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807709)