|
Activity Number:
|
251
|
|
Type:
|
Invited
|
|
Date/Time:
|
Tuesday, August 4, 2009 : 8:30 AM to 10:20 AM
|
|
Sponsor:
|
IMS
|
| Abstract - #303089 |
|
Title:
|
Markov Chain Monte Carlo in Theoretical Computer Science
|
|
Author(s):
|
Alistair Sinclair*+
|
|
Companies:
|
University of California, Berkeley
|
|
Address:
|
Computer Science Division, Berkeley, CA, 94720-1776,
|
|
Keywords:
|
Markov chain Monte Carlo ; theoretical computer science ; statistical physics ; mixing times ; phase transitions ; approximation algorithms
|
|
Abstract:
|
Markov chain Monte Carlo first appeared on the radar screen of theoretical computer scientists about two decades ago. Since then it has emerged as a powerful tool, both in the design of approximation algorithms for many counting and integration problems, and as a bridge to other disciplines such as applied probability and statistical physics. In this talk I will survey some of the highlights in this area, and also outline some of the remaining challenges it poses today.
|
- The address information is for the authors that have a + after their name.
- Authors who are presenting talks have a * after their name.
Back to the full JSM 2009 program |
