Computable upper bounds on the distance to stationarity for Jovanovski and Madras's Gibbs sampler
From MaRDI portal
Publication:5963359
Recommendations
- Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances
- Geometric convergence bounds for Markov chains in Wasserstein distance based on generalized drift and contraction conditions
- Convergence in the Wasserstein Metric for Markov Chain Monte Carlo Algorithms with Applications to Image Restoration
- Quantitative bounds of convergence for geometrically ergodic Markov chain in the Wasserstein distance with application to the Metropolis adjusted Langevin algorithm
- Convergence rates of the blocked Gibbs sampler with random scan in the Wasserstein metric
Cites work
- scientific article; zbMATH DE number 42272 (Why is no real title available?)
- Gibbs sampling, conjugate priors and coupling
- Gibbs sampling, exponential families and orthogonal polynomials
- Inequalities for the gamma function
- Locally contractive iterated function systems
- Markov chains and stochastic stability
- On reparametrization and the Gibbs sampler
- Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances
This page was built for publication: Computable upper bounds on the distance to stationarity for Jovanovski and Madras's Gibbs sampler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963359)