Strong stationary times for features of random walks
arXiv:1910.03837
Abstract
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.