arXiv Analytics

Sign in

arXiv:1910.03837 [math.PR]AbstractReferencesReviewsResources

Strong stationary times for features of random walks

Graham White

Published 2019-10-09Version 1

In [4], we examined the use of coupling to obtain bounds on the mixing time of statistics on Markov chains. In the present paper, we consider the same general problem, but using strong stationary times rather than coupling. We discuss various types of behaviour that may occur when this is attempted, and analyse a variety of examples.

Categories: math.PR
Related articles: Most relevant | Search more
arXiv:1503.08632 [math.PR] (Published 2015-03-30)
Entrance and sojourn times for Markov chains. Application to $(L,R)$-random walks
arXiv:1310.3646 [math.PR] (Published 2013-10-14, updated 2014-08-28)
A topology for limits of Markov chains
arXiv:0806.4441 [math.PR] (Published 2008-06-27)
Probability and Statistics: Essays in Honor of David A. Freedman

Links

Toolbox