Geometric ergodicity of a more efficient conditional Metropolis-Hastings algorithm
From MaRDI portal
Cites work
- A modified conditional Metropolis-Hastings sampler
- A note on Metropolis-Hastings kernels for general state spaces
- Convergence of conditional Metropolis-Hastings samplers
- Fixed-Width Output Analysis for Markov Chain Monte Carlo
- Geometric ergodicity and hybrid Markov chains
- Honest exploration of intractable probability distributions via Markov chain Monte Carlo.
- scientific article; zbMATH DE number 720679 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Markov chain Monte Carlo estimation of quantiles
- Markov chain Monte Carlo: can we trust the third significant figure?
- Markov chains and stochastic stability
- Miscellanea. Peskun's theorem and a modified discrete-state Gibbs sampler
- Monte Carlo strategies in scientific computing
- Nonasymptotic bounds on the estimation error of MCMC algorithms
- On the Markov chain central limit theorem
- Variance bounding and geometric ergodicity of Markov chain Monte Carlo kernels for approximate Bayesian computation
Cited in
(4)- V-subgeometric ergodicity for a Hastings-Metropolis algorithm
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- On the Geometric Ergodicity of Metropolis-Hastings Algorithms for Lattice Gaussian Sampling
- On the geometric ergodicity of Metropolis-Hastings algorithms
This page was built for publication: Geometric ergodicity of a more efficient conditional Metropolis-Hastings algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079080)
