## The Markov Chain Monte Carlo method: an approach to approximate counting and integration (1996)

### Cached

### Download Links

Citations: | 234 - 13 self |

### BibTeX

@INPROCEEDINGS{Jerrum96themarkov,

author = {Mark Jerrum and Alistair Sinclair},

title = {The Markov Chain Monte Carlo method: an approach to approximate counting and integration},

booktitle = {},

year = {1996},

pages = {482--520},

publisher = {PWS Publishing}

}

### Years of Citing Articles

### OpenURL

### Abstract

In the area of statistical physics, Monte Carlo algorithms based on Markov chain simulation have been in use for many years. The validity of these algorithms depends crucially on the rate of convergence to equilibrium of the Markov chain being simulated. Unfortunately, the classical theory of stochastic processes hardly touches on the sort of non-asymptotic analysis required in this application. As a consequence, it had previously not been possible to make useful, mathematically rigorous statements about the quality of the estimates obtained. Within the last ten years, analytical tools have been devised with the aim of correcting this deficiency. As well as permitting the analysis of Monte Carlo algorithms for classical problems in statistical physics, the introduction of these tools has spurred the development of new approximation algorithms for a wider class of problems in combinatorial enumeration and optimization. The “Markov chain Monte Carlo ” method has been applied to a variety of such problems, and often provides the only known efficient (i.e., polynomial time) solution technique.