2 citations · 3 across the 5 of their papers we have counts for
5 papers · 1 filter
Strong stationary times for features of random walks
Graham White
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 st…
Coupling for features of random walks
Graham White
We use coupling to study the time taken until the distribution of a statistic on a Markov chain is close to its stationary distribution. Coupling is a common technique used to obta…
A variation of strong stationary times for random walks with partial symmetries
Graham White
We introduce a variation of strong stationary times for random walks on the symmetric group. Rather than proceed in the usual fashion of accumulating larger and larger blocks of ca…
A strong stationary time for random transpositions
Graham White
We show that the random transposition walk on the symmetric group has cutoff in separation distance at , by constructing a strong stationary time. The co…
A Stationary Planar Random Graph with Singular Stationary Dual: Dyadic Lattice Graphs
Russell Lyons, Graham White
Dyadic lattice graphs and their duals are commonly used as discrete approximations to the hyperbolic plane. We use them to give examples of random rooted graphs that are stationary…