BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Coupling of Markov Chains - Lucas Sonnabend\, Churchill College
DTSTART:20141119T194000Z
DTEND:20141119T203000Z
UID:TALK56028@talks.cam.ac.uk
CONTACT:Jasper Lee
DESCRIPTION:We can model random processes such as shuffling cards using Ma
 rkov chains. For a certain class of them we can find a stationary distribu
 tion to which the process will converge.\n\nI will explain how coupling of
  Markov Chains is used to estimate the time needed to get close to this st
 ationary distribution. For example\, how often do you have to shuffle a de
 ck of cards until you are fairly sure that they are distributed uniformly?
 \n\nIn terms of applications\, I will describe a polynomial time probabili
 stic algorithm for graph colouring\, and I will explain a magic trick!
LOCATION:Wolfson Hall\, Churchill College
END:VEVENT
END:VCALENDAR