 
title Random Walk Sampling: Examples & Techniques for Bounding Mixing Time 

by  Linji Yang

on  Wednesday, February 18th @ 1:30pm 

in  ISyE Executive Classroom

In this talk I will give an introduction of the Markov Chain Monte Carlo Method, which uses markov chains to sample interesting combinatorial objects such as proper colorings, independent sets and perfect matchings of a graph. I will introduce methods such as Couplings and Canonical Paths which have been widely used to analyze how many steps Markov Chains needs to go (mixing time) in order to get a sufficiently random combinatorial object. I will also give a brief survey of some recent results in the sampling of colorings.

. . . . . . . . . . . . . .

This page is maintained by the ACO Webmaster,
at the School of Mathematics,
Georgia Institute of Technology.

Last modified: January 11, 2008

Georgia Tech Disclaimer:
Notwithstanding any language to the contrary, nothing contained herein constitutes nor is intended to constitute an offer, inducement, promise, or contract of any kind. The data contained herein is for informational purposes only and is not represented to be error free. Any links to non-Georgia Tech information are provided as a courtesy. They are not intended to nor do they constitute an endorsement by the Georgia Institute of Technology of the linked materials.