text-only page produced automatically by LIFT Text Transcoder Skip all navigation and go to page contentSkip top navigation and go to directorate navigationSkip top navigation and go to page navigation
National Science Foundation
Search  
Awards
design element
Search Awards
Recent Awards
Presidential and Honorary Awards
About Awards
Grant Policy Manual
Grant General Conditions
Cooperative Agreement Conditions
Special Conditions
Federal Demonstration Partnership
Policy Office Website


Award Abstract #0237834
CAREER: Markov Chain Monte Carlo Methods


NSF Org: CCF
Division of Computer and Communication Foundations
divider line
divider line
Initial Amendment Date: May 5, 2003
divider line
Latest Amendment Date: May 27, 2004
divider line
Award Number: 0237834
divider line
Award Instrument: Continuing grant
divider line
Program Manager: David Hung-Chang Du
CCF Division of Computer and Communication Foundations
CSE Directorate for Computer & Information Science & Engineering
divider line
Start Date: August 1, 2003
divider line
Expires: November 30, 2004 (Estimated)
divider line
Awarded Amount to Date: $157228
divider line
Investigator(s): Eric Vigoda vigoda@cc.gatech.edu (Principal Investigator)
divider line
Sponsor: University of Chicago
5801 South Ellis Avenue
Chicago, IL 60637 773/702-8602
divider line
NSF Program(s): THEORY OF COMPUTING
divider line
Field Application(s):
divider line
Program Reference Code(s): HPCC,9216,1187,1045
divider line
Program Element Code(s): 2860

ABSTRACT

Markov chain Monte Carlo (MCMC) methods are an important

algorithmic device in a variety of fields. This project studies

techniques for rigorous analysis of the convergence properties of

Markov chains. The emphasis is on refining probabilistic,

analytic and combinatorial tools (such as coupling, log-Sobolev,

and canonical paths) to improve existing algorithms and develop

efficient algorithms for important open problems.

Problems arising in computer science, discrete mathematics,

and physics are of particular interest, e.g., generating random

colorings and independent sets of bounded-degree graphs,

approximating the permanent, estimating the volume of a

convex body, and sampling contingency tables. The project

also studies inherent connections between phase

transitions in statistical physics models and convergence

properties of associated Markov chains.

The investigator is developing a new graduate course on MCMC methods.

 

Please report errors in award information by writing to: awardsearch@nsf.gov.

 

 

Print this page
Back to Top of page
  Web Policies and Important Links | Privacy | FOIA | Help | Contact NSF | Contact Web Master | SiteMap  
National Science Foundation
The National Science Foundation, 4201 Wilson Boulevard, Arlington, Virginia 22230, USA
Tel: (703) 292-5111, FIRS: (800) 877-8339 | TDD: (800) 281-8749
Last Updated:
April 2, 2007
Text Only


Last Updated:April 2, 2007