Author:
Anderson Robert M.,Duanmu Haosui,Smith Aaron
Abstract
AbstractThe hitting and mixing times are two fundamental quantities associated with Markov chains. In Peres and Sousi [PS15] and Oliveira [Oli12], the authors show that the mixing times and “worst-case” hitting times of reversible Markov chains on finite state spaces are equal up to some universal multiplicative constant. We use tools from nonstandard analysis to extend this result to reversible Markov chains on general state spaces that satisfy the strong Feller property. Finally, we show that this asymptotic equivalence can be used to find bounds on the mixing times of a large class of Markov chains used in MCMC, such as typical Gibbs samplers and Metropolis–Hastings chains, even though they usually do not satisfy the strong Feller property.
Publisher
Springer Science and Business Media LLC
Reference50 articles.
1. L. Addario-Berry and M. I. Roberts, Mixing time bounds via bottleneck sequences, Journal of Statistical Physics 173 (2018), 845–871.
2. NATO Advanced Science Institutes Series C: Mathematical and Physical Sciences,1997
3. R. M. Anderson, H. Duanmu and A. Smith, Mixing and average mixing times for general Markov processes, Canadian Mathematical Bulletin 64 (2021), 541–552.
4. R. M. Anderson, H. Duanmu and A. Smith, Mixing and hitting times for Gibbs samplers and other non-Feller processes, Illinois Journal of Mathematics 65 (2021), 547–577.
5. D. Aldous and J. A. Fill, Reversible Markov chains and random walks on graphs, http://www.stat.berkeley.edu/∼aldous/RWG/book.html.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献