3 citations · 3 across the 3 of their papers we have counts for
6 papers
The Aldous chain on cladograms mixes in order steps
Valentin Féray, Lucas Teyssier
Cladograms of size are unrooted binary trees whose leaves are labelled from 1 to . Aldous introduced in 2000 a Markov chain on cladograms, a step of which consists of removi…
Stationary hitting times on vertex-transitive graphs
Nathanaël Berestycki, Jonathan Hermon, Lucas Teyssier
We prove a refined version of the Aldous and Brown's exponential approximation of stationary hitting times. These are valid for all reversible Markov chains. We then specialise our…
Every cutoff profile is possible
Lucas Teyssier
We introduce fruit-inosculated-tree Markov chains. These chains have easily tunable parameters and are a good source of examples. In particular, we prove that every cutoff profile…
On the universality of fluctuations for the cover time
Nathanaël Berestycki, Jonathan Hermon, Lucas Teyssier
We consider random walks on finite vertex-transitive graphs of bounded degree. We find a simple geometric condition which characterises the cover time fluctuations: the suitabl…
Cutoff profiles for quantum Lévy processes and quantum random transpositions
Amaury Freslon, Lucas Teyssier, Simeng Wang
We consider a natural analogue of Brownian motion on free orthogonal quantum groups and prove that it exhibits a cutoff at time . Then, we study the induced classical proc…
Limit profile for random transpositions
Lucas Teyssier
We present an improved version of Diaconis' upper bound lemma, which is used to compute the limiting value of the distance to stationarity. We then apply it to random transposition…