pith. sign in

arxiv: 1810.06087 · v2 · pith:DPXRQDPVnew · submitted 2018-10-14 · 🧮 math.PR

Mixing Times and Hitting Times for General Markov Processes

classification 🧮 math.PR
keywords timeschainsmarkovmixinghittingfellergeneralproperty
0
0 comments X
read the original abstract

The hitting and mixing times are two fundamental quantities associated with Markov chains. In Peres and Sousi[PS2015] and Oliveira[Oli2012], 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 Metroplis-Hastings chains, even though they usually do not satisfy the strong Feller property.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.