The revival of interest in Markov chains is based in part on their recent applicability in solving real world problems and in part on their ability to resolve issues in theoretical computer science. This paper presents three examples which are used to illustrate both parts: a Markov chain algorithm for estimating the tails of the bootstrap also illustrates the Jerrum-Sinclair theory of approximate counting. The Geyer-Thompson work on Monte-Carlo evaluation of maximum likelihood is compared with work on evaluation of the partition function. Finally, work of Diaconis-Sturmfels on conditional inference is complemented by the work of theoretical computer scientists on approximate computation of the volume of convex polyhedra.
CITATION STYLE
Diaconis, P., & Holmes, S. (1995). Three Examples of Monte-Carlo Markov Chains: At the Interface Between Statistical Computing, Computer Science, and Statistical Mechanics (pp. 43–56). https://doi.org/10.1007/978-1-4612-0801-3_4
Mendeley helps you to discover research relevant for your work.