Abstract
The pace of research on MCMC methods is so quick that any survey of advanced topics is immediately obsolete. The highly eclectic and decidedly biased coverage in our final chapter begins with a discussion of Markov random fields. Our limited aims here are to prove the Hammersley-Clifford theorem and introduce the Swendsen-Wang algorithm, a clever form of slice sampling. In the Ising model, the Swendsen-Wang algorithm is much more efficient than standard Gibbs sampling.
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
Akhiezer NI, Glazman IM (1993) Theory of Linear Operators in Hilbert Space. Dover, New York
Brémaud P (1999) Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues. Springer
Brook D (1964) On the distinction between the conditional and the joint probability approaches in the specification of nearest-neighbor systems. Biometrika 51:481-483
Conway JB (1985) A Course on Functional Analysis. Springer, New York
Diaconis P (1988) Group Representations in Probability and Statistics. Institute of Mathematical Statistics, Hayward, CA
Diaconis P, Khare K, Saloff-Coste L (2008) Gibbs sampling, exponen- tial families and orthogonal polynomials. Stat Science 23:151-178
Edwards RG, Sokal AD (1988) Generalizations of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm. Physical Review D 38:2009-2012
Green PJ (1995) Reversible jump Markov chain Monte Carlo computation and Bayesian model determination. Biometrika 82:711-732
Hastie D, Green PJ (2009) Reversible jump MCMC. (unpublished lecture notes)
Jones GL (2004) On the Markov chain central limit theorem. Prob Surveys 1:299-320
Levin DA, Peres Y, Wilmer EL (2008) Markov Chains and Mixing Times. Amer Math Soc, Providence, RI
Liu JS (1996) Metropolized independent sampling with comparisons to rejection sampling and importance sampling. Stat and Computing 6:113-119
Liu JS (2001) Monte Carlo Strategies in Scientific Computing. Springer, New York
Richardson S, Green PJ (1997) On Bayesian analysis of mixtures with an unknown number of components. J Royal Stat Soc B 59:731-792
Robert CP, Casella G (2004) Monte Carlo Statistical Methods, 2nd ed. Springer, New York
Rosenthal JS (1995) Convergence rates of Markov chains. SIAM Review 37:387-405
Rynne BP, Youngson MA (2008) Linear Functional Analysis. Springer, New York
Stein EM, Shakarchi R (2005) Real Analysis: Measure Theory, Integration, and Hilbert Spaces. Princeton University Press, Princeton, NJ
Swendsen RH, Wang JS (1987) Nonuniversal critical dynamics in Monte Carlo simulations. Physical Review Letters 58:86-88
Tierney L (1994) Markov chains for exploring posterior distributions (with discussion). Ann Stat 22:1701-1762
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer New York
About this chapter
Cite this chapter
Lange, K. (2010). Advanced Topics in MCMC. In: Numerical Analysis for Statisticians. Statistics and Computing. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-5945-4_27
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5945-4_27
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-5944-7
Online ISBN: 978-1-4419-5945-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)