Presentation by Liam P. Wilbers, University of Kiel, Germany; Acadia University (2025-2026)
Speaker: Liam P. Wilbers, University of Kiel, Germany; Acadia University (2025-2026)
📅 Date: Fri, March 13 ⏰ Time: 4pm 📍 Location: HSH 147
Title: Top-to-Random Shuffle and other shuffle algorithms - introduction and comparison.
Abstract: This talk introduces the Top-to-Random shuffle and other card-shuffling algorithms using Markov chains and basic stochastic concepts. The goal is to derive lower and upper bounds for the number of shuffles required to randomize a deck of cards. This leads to the fundamental question: How long does it take to sufficiently shuffle a deck? To answer this, we first need to clarify what it actually means for a deck to be well shuffled, which naturally leads to the concept of mixing time.
