A Tutorial on Reversible Jump MCMC with a View toward Applications in QTL‐mapping
- 1 April 2001
- journal article
- Published by Wiley in International Statistical Review
- Vol. 69 (1) , 49-61
- https://doi.org/10.1111/j.1751-5823.2001.tb00479.x
Abstract
Summary: A tutorial derivation of the reversible jump Markov chain Monte Carlo (MCMC) algorithm is given. Various examples illustrate how reversible jump MCMC is a general framework for Metropolis‐Hastings algorithms where the proposal and the target distribution may have densities on spaces of varying dimension. It is finally discussed how reversible jump MCMC can be applied in genetics to compute the posterior distribution of the number, locations, effects, and genotypes of putative quantitative trait loci.Keywords
This publication has 17 references indexed in Scilit:
- Bayesian Analysis of Quantitative Trait Locus Data Using Reversible Jump Markov Chain Monte CarloPublished by JSTOR ,1998
- Automatic Bayesian Curve FittingJournal of the Royal Statistical Society Series B: Statistical Methodology, 1998
- Markov Chain Monte Carlo Segregation and Linkage Analysis for Oligogenic ModelsAmerican Journal of Human Genetics, 1997
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determinationBiometrika, 1995
- Understanding the Metropolis-Hastings AlgorithmThe American Statistician, 1995
- Bayesian Computation and Stochastic SystemsStatistical Science, 1995
- Explaining the Gibbs SamplerThe American Statistician, 1992
- Optimum Monte-Carlo sampling using Markov chainsBiometrika, 1973
- Monte Carlo sampling methods using Markov chains and their applicationsBiometrika, 1970
- Monte Carlo Sampling Methods Using Markov Chains and Their ApplicationsBiometrika, 1970