An Introduction to Markov Chain Monte Carlo
31 Pages Posted: 26 Apr 2010
Date Written: March 1, 2010
Abstract
This paper introduces the method of Markov Chain Monte Carlo (MCMC). An outline of the methods is given together with some preliminary tools. The Bayesian approach to statistics is introduced, and the necessary continuous state space Markov chain theory is summarized. Two common algorithms for generating random draws from complex joint distribution are presented; The Gibbs sampler and the Metropolis-Hastings algorithm. We discuss implementational issues and demonstrate the method by a simple empirical example on a generalized linear mixed model. The reader is assumed to have background in probability theory and to be familiar with discrete time Markov chains on a finite state space.
Keywords: Markov Chain Monte Carlo, MCMC, Bayesian, Generalized Linear Mixed Model, GLMM, Simulation, Gibbs Sampler, Metropolis-Hastings Algorithm
JEL Classification: C11, C15
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
Specification Analysis of Affine Term Structure Models
By Qiang Dai and Kenneth J. Singleton
-
Specification Analysis of Affine Term Structure Models
By Qiang Dai and Kenneth J. Singleton
-
By Andrew Ang and Monika Piazzesi
-
By Andrew Ang and Monika Piazzesi
-
By John H. Cochrane and Monika Piazzesi
-
Expectation Puzzles, Time-Varying Risk Premia, and Dynamic Models of the Term Structure
By Qiang Dai and Kenneth J. Singleton
-
Expectation Puzzles, Time-Varying Risk Premia, and Dynamic Models of the Term Structure
By Qiang Dai and Kenneth J. Singleton
-
Expectation Puzzles, Time-Varying Risk Premia, and Dynamic Models of the Term Structure
By Qiang Dai and Kenneth J. Singleton
-
Expectation Puzzles, Time-Varying Risk Premia, and Dynamic Models of the Term Structure
By Qiang Dai and Kenneth J. Singleton