Strong stationary times for features of random walks
Probability
2019-10-10 v1
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.
Cite
@article{arxiv.1910.03837,
title = {Strong stationary times for features of random walks},
author = {Graham White},
journal= {arXiv preprint arXiv:1910.03837},
year = {2019}
}