# Markov Chains for Exploring Posterior Distributions

```@article{Tierney1994MarkovCF,
title={Markov Chains for Exploring Posterior Distributions},
author={Luke Tierney},
journal={Annals of Statistics},
year={1994},
volume={22},
pages={1701-1728}
}```
• L. Tierney
• Published 1994
• Mathematics
• Annals of Statistics
Several Markov chain methods are available for sampling from a posterior distribution. Two important examples are the Gibbs sampler and the Metropolis algorithm. In addition, several strategies are available for constructing hybrid algorithms. This paper outlines some of the basic methods and strategies and discusses some related theoretical and practical issues. On the theoretical side, results from the theory of general state space Markov chains can be used to obtain convergence rates, laws… Expand
3,771 Citations
MARKOV CHAIN MONTE CARLO METHODS: COMPUTATION AND INFERENCE
This chapter provides background on the relevant Markov chain theory and provides detailed information on the theory and practice of MarkovChain sampling based on the Metropolis-Hastings and Gibbs sampling algorithms. Expand
Markov Chain Monte Carlo
Markov chain Monte Carlo (MCMC) is a technique for estimating by simulation the expectation of a statistic in a complex model. Successive random selections form a Markov chain, the stationaryExpand
Markov Chain Monte Carlo Methods for Statistical Inference
These notes provide an introduction to Markov chain Monte Carlo methods and their applications to both Bayesian and frequentist statistical inference. Such methods have revolutionized what can beExpand
An Introduction to Markov Chain Monte Carlo
The Bayesian approach to statistics is introduced, and the necessary continuous state space Markov chain theory is summarized, and two common algorithms for generating random draws from complex joint distribution are presented. Expand
Monte Carlo Methods and Bayesian Computation : MCMC
Markov chain Monte Carlo (MCMC) methods use computer simulation of Markov chains in the parameter space. The Markov chains are defined in such a way that the posterior distribution in the givenExpand
Studying Convergence of Markov Chain Monte Carlo Algorithms Using Coupled Sample Paths
Abstract I describe a simple procedure for investigating the convergence properties of Markov chain Monte Carlo sampling schemes. The procedure uses coupled chains from the same sampler, obtained byExpand
Over-relaxation methods and coupled Markov chains for Monte Carlo simulation
• Mathematics, Computer Science
• Stat. Comput.
• 2002
A new algorithm for simulating from multivariate Gaussian densities is proposed, which combines ideas from coupled Markov chain methods and from an existing algorithm based only on over-relaxation. Expand
Metropolis Sampling
• Mathematics, Computer Science
• 2017
This document describes in details all the elements involved in the MH algorithm and the most relevant variants, providing a quick but exhaustive overview of the current Metropolis-based sampling’s world. Expand
Hypothesis Tests of Convergence in Markov Chain Monte Carlo
Abstract Deciding when a Markov chain has reached its stationary distribution is a major problem in applications of Markov Chain Monte Carlo methods. Many methods have been proposed ranging fromExpand
Markov chain Monte Carlo for dynamic generalised linear models
SUMMARY This paper presents a new methodological approach for carrying out Bayesian inference about dynamic models for exponential family observations. The approach is simulationbased and involvesExpand