Stability of adversarial Markov chains, with an application to adaptive MCMC algorithms
DOI10.1214/14-AAP1083zbMath1328.60169arXiv1403.3950MaRDI QIDQ894817
Jeffrey S. Rosenthal, Gareth O. Roberts, Radu V. Craiu, Krzysztof Łatuszyński, Neal Madras, Lawrence F. Gray
Publication date: 24 November 2015
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.3950
Computational methods in Markov chains (60J22) Point estimation (62F10) Bayesian inference (62F15) Monte Carlo methods (65C05) Discrete-time Markov processes on general state spaces (60J05) Numerical analysis or methods applied to Markov chains (65C40)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limit theorems for some adaptive MCMC algorithms with subgeometric kernels
- On the ergodicity of the adaptive Metropolis algorithm on unbounded domains
- Markov chains and stochastic stability
- On adaptive Markov chain Monte Carlo algorithms
- On the ergodicity properties of some adaptive MCMC algorithms
- General state space Markov chains and MCMC algorithms
- Two convergence properties of hybrid samplers
- Moment conditions for a sequence with negative drift to be uniformly bounded in \(L^r\)
- Adaptive Gibbs samplers and related MCMC methods
- Adversarial queuing theory
- Learn From Thy Neighbor: Parallel-Chain and Regional Adaptive MCMC
- General Irreducible Markov Chains and Non-Negative Operators
- Handbook of Markov Chain Monte Carlo
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
- On the notion of recurrence in discrete stochastic processes
- An adaptive Metropolis algorithm
This page was built for publication: Stability of adversarial Markov chains, with an application to adaptive MCMC algorithms