Kernel Selection for Convergence and Efficiency in Markov Chain Monte Carol
Markov Chain Monte Carlo (MCMC) is a technique for sampling from a target probability distribution, and has risen in importance as faster computing hardware has made possible the exploration of hitherto difficult distributions. Unfortunately, this powerful technique is often misapplied by poor selec...
Main Author: | Potter, Christopher C. J. |
---|---|
Format: | Others |
Published: |
Research Showcase @ CMU
2013
|
Subjects: | |
Online Access: | http://repository.cmu.edu/dissertations/249 http://repository.cmu.edu/cgi/viewcontent.cgi?article=1247&context=dissertations |
Similar Items
-
An efficient interpolation technique for jump proposals in reversible-jump Markov chain Monte Carlo calculations
by: W. M. Farr, et al.
Published: (2015-01-01) -
When Infinity is Too Long to Wait: On the Convergence of Markov Chain Monte Carlo Methods
by: Olsen, Andrew Nolan
Published: (2015) -
MCMCpack: Markov Chain Monte Carlo in R
by: Andrew D. Martin, et al.
Published: (2011-08-01) -
Monitoring and Improving Markov Chain Monte Carlo Convergence by Partitioning
by: VanDerwerken, Douglas
Published: (2015) -
Parameter Estimation in Population Balance through Bayesian Technique Markov Chain Monte Carlo
by: Carlos H.R. Moura, et al.
Published: (2021-04-01)