Publication:3405572
From MaRDI portal
zbMath1186.62038MaRDI QIDQ3405572
Cristian Pasarica, Andrew Gelman
Publication date: 10 February 2010
Full work available at URL: http://www3.stat.sinica.edu.tw/statistica/J20N1/J20N113/J20N113.html
Markov chain Monte Carlo; Bayesian computation; acceptance rates; multiple importance sampling; iterative simulation
Related Items
Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms, Asymptotic analysis of the random walk metropolis algorithm on ridged densities, Designing simple and efficient Markov chain Monte Carlo proposal kernels, A Bayesian hierarchical model for spatial extremes with multiple durations, On the efficiency of pseudo-marginal random walk Metropolis algorithms, Estimation of realized stochastic volatility models using Hamiltonian Monte Carlo-based methods, Optimal tuning of the hybrid Monte Carlo algorithm, Adaptive Metropolis-Hastings sampling using reversible dependent mixture proposals, On the empirical efficiency of local MCMC algorithms with pools of proposals, Optimal scaling of Metropolis algorithms: Heading toward general target distributions