University of Cambridge > Talks.cam > Churchill CompSci Talks > Coupling of Markov Chains

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Coupling of Markov Chains

Download to your calendar using vCal

If you have a question about this talk, please contact Jasper Lee .

We can model random processes such as shuffling cards using Markov chains. For a certain class of them we can find a stationary distribution to which the process will converge.

I will explain how coupling of Markov Chains is used to estimate the time needed to get close to this stationary distribution. For example, how often do you have to shuffle a deck of cards until you are fairly sure that they are distributed uniformly?

In terms of applications, I will describe a polynomial time probabilistic algorithm for graph colouring, and I will explain a magic trick!

This talk is part of the Churchill CompSci Talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cam*Era CBU lecture theatre William Mong Building, Sidney Sussex College

Other talks

Optimal metric and approximation of free boundary minimal surfaces Talk TBC Fairy Tales The organisational management of traumatic stress Title and abstract tba Coexisting with carnivores? The lynx and wolf reintroduction debate
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity