| |
| | Hemanshu Kaul: Proposal for a Course on Topics in Probabilistic Methods |
 | | The focus is on developing the themes underlying the various methods and illustrating the final results through applications in graph theory, combinatorial optimization and theoretical computer science. |
 | | These methods, including coupling, conductance, and canonical paths, will be used in applications of the MCMC method to the Knapsack problem, proper colorings of a graph, linear extensions of a poset, permanent of a 0,1-matrix, etc. |
 | | Jerrum, Mathematical foundations of the Markov chain Monte Carlo method, In Probabilistic Methods for Algorithmic Discrete Mathematics, (Springer, 1998), 116--165. |
| www.math.uiuc.edu /~hkaul/MethodsCourseProposal.html (970 words) |
|