Geometric convergence of the Metropolis-Hastings simulation algorithm
From MaRDI portal
Publication:1273019
Recommendations
Cites work
Cited in
(15)- Geometric ergodicity of Metropolis algorithms
- Improving Convergence of the Hastings–Metropolis Algorithm with an Adaptive Proposal
- On the convergence of the Metropolis-Hastings Markov chains
- Improved Sampling‐Importance Resampling and Reduced Bias Importance Sampling
- A geometric interpretation of the Metropolis-Hastings algorithm.
- On the geometric ergodicity of Metropolis-Hastings algorithms
- Mixing of MCMC algorithms
- Geometric ergodicity of Metropolis-Hastings algorithms for conditional simulation in generalized linear mixed models
- Rates of convergence of the Hastings and Metropolis algorithms
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Bayesian analysis of the logit model and comparison of two Metropolis-Hastings strategies.
- Numerical Results for the Metropolis Algorithm
- Adaptive independent Metropolis-Hastings
- scientific article; zbMATH DE number 5722739 (Why is no real title available?)
- Markov-chain monte carlo: Some practical implications of theoretical results
This page was built for publication: Geometric convergence of the Metropolis-Hastings simulation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273019)