![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
Coupling of Markov ChainsAdd to your list(s) 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 listsBuddhism Talk on Silent Illumination Meditation Education Society Cambridge (ESC) Seven Types of ForgettingOther talksWhat is the History of the Book? Child Kingship from a Comparative Perspective: Boy Kings in England, Scotland, France, and Germany, 1050-1250 On the origin of human sociality: Ape minds and the evolution of Homo sapiens Rhys Jones: Temporal Claustrophobia at the Continental Congress, 1774-1776 The Ethical and Legal Elements of Capacity and Consent |