Ergodicity of Markov chain Monte Carlo with reversible proposal
From MaRDI portal
Publication:4684877
Abstract: We describe ergodic properties of some Metropolis-Hastings (MH) algorithms for heavy-tailed target distributions. The analysis usually falls into sub-geometric ergodicity framework but we prove that the mixed preconditioned Crank-Nicolson (MpCN) algorithm has geometric ergodicity even for heavy-tailed target distributions. This useful property comes from the fact that the MpCN algorithm becomes a random-walk Metropolis algorithm under suitable transformation.
Recommendations
- scientific article; zbMATH DE number 5520724
- Efficient strategy for the Markov chain Monte Carlo in high-dimension with heavy-tailed target probability distribution
- Geometric ergodicity of Metropolis algorithms
- Sufficient Conditions for Ergodicity and Convergence of MH, SA, and EM Algorithms
- On the geometric ergodicity of Metropolis-Hastings algorithms
Cites work
- scientific article; zbMATH DE number 5520724 (Why is no real title available?)
- scientific article; zbMATH DE number 43570 (Why is no real title available?)
- scientific article; zbMATH DE number 2042684 (Why is no real title available?)
- scientific article; zbMATH DE number 1522714 (Why is no real title available?)
- scientific article; zbMATH DE number 5242364 (Why is no real title available?)
- Accelerated dimension-independent adaptive metropolis
- General Irreducible Markov Chains and Non-Negative Operators
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Geometric ergodicity of Metropolis algorithms
- Handbook of Markov Chain Monte Carlo
- Hybrid multi-step estimators for stochastic differential equations based on sampled data
- Limit theorems for some adaptive MCMC algorithms with subgeometric kernels
- MCMC METHODS FOR DIFFUSION BRIDGES
- Markov Chains and Stochastic Stability
- Markov chains for exploring posterior distributions. (With discussion)
- Metropolis-Hastings algorithms with acceptance ratios of nearly 1
- Multiplicative random walk Metropolis-Hastings on the real line
- Necessary conditions for geometric and polynomial ergodicity of random-walk-type Markov chains
- On a generalization of the preconditioned Crank-Nicolson metropolis algorithm
- On an adaptive preconditioned Crank-Nicolson MCMC algorithm for infinite dimensional Bayesian inference
- Polynomial convergence rates of Markov chains
- Polynomial ergodicity of Markov transition kernels.
- Practical drift conditions for subgeometric rates of convergence.
- Proposals which speed up function-space MCMC
- Rates of convergence of the Hastings and Metropolis algorithms
- Spectral gaps for a Metropolis-Hastings algorithm in infinite dimensions
- Subgeometric Rates of Convergence of f-Ergodic Markov Chains
- Variable transformation to obtain geometric ergodicity in the random-walk Metropolis algorithm
- \(V\)-subgeometric ergodicity for a Hastings-Metropolis algorithm
Cited in
(10)- Markov chain Monte Carlo and irreversibility
- Reversibility violation in the hybrid Monte Carlo algorithm
- Sequential Kalman tuning of the \(t\)-preconditioned Crank-Nicolson algorithm: efficient, adaptive and gradient-free inference for Bayesian inverse problems
- scientific article; zbMATH DE number 7387626 (Why is no real title available?)
- scientific article; zbMATH DE number 1998565 (Why is no real title available?)
- Non-reversible guided Metropolis kernel
- Continuum versus discrete networks, graph Laplacians, and reproducing kernel Hilbert spaces
- Estimation of risk contributions with MCMC
- Efficient strategy for the Markov chain Monte Carlo in high-dimension with heavy-tailed target probability distribution
- MCMC Algorithms for Posteriors on Matrix Spaces
This page was built for publication: Ergodicity of Markov chain Monte Carlo with reversible proposal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4684877)
