Computable upper bounds on the distance to stationarity for Jovanovski and Madras's Gibbs sampler
From MaRDI portal
Publication:5963359
DOI10.5802/AFST.1470zbMATH Open1385.60056OpenAlexW2567488619MaRDI QIDQ5963359FDOQ5963359
Authors: James P. Hobert, Kshitij Khare 
Publication date: 19 February 2016
Published in: Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5802/afst.1470
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
Computational methods in Markov chains (60J22) Discrete-time Markov processes on general state spaces (60J05)
Cites Work
- Markov chains and stochastic stability
- Inequalities for the gamma function
- Title not available (Why is that?)
- Gibbs sampling, exponential families and orthogonal polynomials
- Gibbs sampling, conjugate priors and coupling
- Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances
- Locally contractive iterated function systems
- On reparametrization and the Gibbs sampler
Cited In (1)
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)
