Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Waagepetersen et al. (2001) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: