activity
20172021
most citedA strong stationary time for random transpositions

2 citations · 3 across the 5 of their papers we have counts for

collaborators

9 papers

math.CO2021

Excessive symmetry can preclude cutoff

Eric Ramos, Graham White

For each , let denote the Kneser Graph; that whose vertices are labeled by -element subsets of , and whose edges indicate that the corresponding subsets…

math.PR20191 cited

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…

math.PR2019

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…

math.PR2019

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…

math.PR20192 cited

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…

math.CO2018

Families of Markov chains with compatible symmetric-group actions

Eric Ramos, Graham White

For each , let denote the Kneser Graph; that whose vertices are labeled by -element subsets of , and whose edges indicate that the corresponding subsets…