Graduate Student Seminar - Benoit Corsini

Title: Do you even shuffle bro?!?

Abstract:

In probability, it is common under certain assumptions to have some sort of convergence: law of large numbers, central limit theorem, etc. But once we know that something converges, we may ask how fast it does so. In the case of Markov chains, this convergence time is called the mixing time: the time needed to be randomly mixed according to the limit probability. I will present the mixing time by answering the worldwide question "how many times should I shuffle my deck of cards?" No magic trick knowledge is required for this talk.