A discrete probability problem in card shuffling

DOI10.1080/03610926.2013.834451zbMATH Open1338.60021OpenAlexW2055391385MaRDI QIDQ2807709FDOQ2807709

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

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

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

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)

Cites Work

• Statistical problems involving permutations with restricted positions
• Two-Sided Eulerian Numbers via Balls in Boxes
• Title not available (Why is that?)
• Counting permutations by their rigid patterns

Cited In (2)

• Card shuffling and Diophantine approximation
• Title not available (Why is that?)

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)