Note on the Sampling Distribution for the Metropolis-Hastings Algorithm
From MaRDI portal
Publication:4801416
DOI10.1081/STA-120018828zbMath1183.62047OpenAlexW2133785255MaRDI QIDQ4801416
Hisashi Tanizaki, John F. Geweke
Publication date: 7 April 2003
Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1081/sta-120018828
Related Items
Modified Cholesky Riemann manifold Hamiltonian Monte Carlo: exploiting sparsity for fast sampling of high-dimensional targets ⋮ A method of generating random vectors with a given probability density function ⋮ Entropy-randomized method for the reconstruction of missing data ⋮ PDE-constrained optimization in medical image analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Posterior simulation and Bayes factors in panel count data models
- Simple conditions for the convergence of the Gibbs sampler and Metropolis-Hastings algorithms
- Bayesian computation and stochastic systems. With comments and reply.
- Markov chains for exploring posterior distributions. (With discussion)
- Rates of convergence of the Hastings and Metropolis algorithms
- Monte Carlo methods in Bayesian computation
- On markov chain monte carlo methods for nonlinear and non-gaussian state-space models
- Contemporary Bayesian Econometrics and Statistics
- Bayesian estimation of state-space models using the Metropolis-Hastings algorithm within Gibbs sampling.