Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barone, P., Frigessi A. and Piccioni M. (editors), 1992, Stochastic Models, Statistical Methods, and Algorithms in Image Analysis, Lecture Notes in Statistics, Springer-Verlag.
Broder, A. (1986). How Hard is it to Marry at Random? (On the approximation of the permanent.) Proc. 18th ACM Symp. Th. Comp., 50–58. Erratum in Proc. 20th ACM Symp. Th. Comp., 551.
Chung F., Graham R., and Yau, S.T. (1994). Unpublished manuscript.
Diaconis, P. and Efron, B. (1986). Testing for independence in a two-way table: new interpretations of the chi-square statistic (with discussion). Ann. Statist. 13, 845–905.
Diaconis, P. and Gangolli, A. (1994). The number of arrays with given row and column sums. In this volume.
Diaconis P., Graham, R.L., and Sturmfels, B. (1994). Primitive Partition Identities. Technical Report No. 9, Dept. of Statistics, Stanford University.
Diaconis, P. and Holmes, S. (1994a). Gray codes for randomization procedures. Technical Report No. 10, Dept. of Statistics, Stanford University.
Diaconis, P. and Holmes, S. (1994b). Random walks for bootstrap tails. Technical Report, Dept. of Mathematics, Harvard University.
Diaconis, P. and Saloff-Coste, L. (1993). Comparison theorems for reversible Markov chains. Ann. Appl. Prob. 3, 696–730.
Diaconis, P. and Sturmfels, B. (1993). Algebraic algorithms for sampling from conditional distributions. Technical Report, Dept. of Mathematics, Harvard University.
Dyer, M. and Frieze, A. (1991). Computing the volume of convex bodies: a case where randomness proveably helps. Probabilistic Combinatorics and its Applications, B. Bollobàs (ed.), Proc. Symp. Appl. Math. 44, 123-170, Amer. Math. Soc, Providenc
Efron, B. (1979). Bootstrap methods: another look at the jackknife. Ann. Statist., 7, 1–26.
Efron, B. and Tibshirani, R. (1993). An Introduction to the Bootstrap. Chapman and Hall.
Gangolli, A. (1991). Convergence bounds for Markov chains and applications to sampling. Ph.D. Dissertation, Dept. of Computer Science, Stanford University.
Geyer, C. and Thompson, E. (1992). Constrained Monte Carlo maximum likelihood for dependent data. Jour. Roy. Statist. Soc. B 54, 657–699.
Geyer, C. and Thompson, E. (1993). Analysis of relatedness in the California condors, from DNA fingerprints. Mol Biol. Evol. 10, 571–589.
Gillman, D. (1993). A Chernoff bound for random walks on expander graphs. Preprint.
Hall, P. (1992). The Bootstrap and Edgeworth Expansions, Springer-Verlag.
Höglund, T. (1974). Central limit theorems and statistical inference for finite Markov chains. Zeit. Wahr. Verw. Gebeits. 29, 123–151.
Jerrum, M. and Sinclair, A. (1989). Approximating the permanent. Siam J. Comput. vn18, 1149–1178.
Jerrum, M. and Sinclair, A. (1993). Polynomial time approximation algorithms for the Ising model, Siam J. Comp., 22, 1087–1116.
Jerrum M., Valiant, L. and Vazirani, V. (1986). Random generation of combinatorial structures from a uniform distribution, Theor. Comput. Sci. 43, 169–188.
Kannan R., Lovasz, L. and Simonovitz, M. (1994). Unpublished manuscript.
Kannan, R. and Mount, J. (1994). Unpublished manuscript.
Mann, B. (1994). Some formulae for enumeration of contingency tables. Technical Report, Harvard University.
Sinclair, A. (1993). Algorithms for random generation and counting, Birkhäuser, Boston.
Valiant, L. (1979). The complexity of computing the permanent. Theor. Comput. Sci. 8, 189–201.
Welsh, D. (1993). Complexity: Knots, colourings and counting, Cambridge University Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this paper
Cite this paper
Diaconis, P., Holmes, S. (1995). Three Examples of Monte-Carlo Markov Chains: At the Interface Between Statistical Computing, Computer Science, and Statistical Mechanics. In: Aldous, D., Diaconis, P., Spencer, J., Steele, J.M. (eds) Discrete Probability and Algorithms. The IMA Volumes in Mathematics and its Applications, vol 72. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0801-3_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0801-3_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6905-2
Online ISBN: 978-1-4612-0801-3
eBook Packages: Springer Book Archive