activity
20182024
most citedLimit Profiles for Reversible Markov Chains

15 citations · 40 across the 8 of their papers we have counts for

collaborators

8 papers

math.PR2024

Time-Biased Random Walks and Robustness of Expanders

Sam Olesker-Taylor, Thomas Sauerwald, John Sylvester

Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they ar…

math.PR2024

Limit Profile for the Bernoulli--Laplace Urn

Sam Olesker-Taylor, Dominik Schmid

We analyse the convergence to equilibrium of the Bernoulli--Laplace urn model: initially, one urn contains red balls and a second blue balls; in each step, a pair of ball…

math.PR2024

Catalan percolation

Eleanor Archer, Ivailo Hartarsky, Brett Kolesnik +3

In Catalan percolation, all nearest-neighbor edges along are initially occupied, and all other edges are open independently with probability . Open edges…

math.PR2022★ 2 cited

Limit Profile for Projections of Random Walks on Groups

Evita Nestoridi, Sam Olesker-Taylor

Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in det…

math.PR2021★ 8 cited

Cutoff for Almost All Random Walks on Abelian Groups

Jonathan Hermon, Sam Olesker-Taylor

Consider the random Cayley graph of a finite group with respect to generators chosen uniformly at random, with ; denote it . A conjecture of…

math.PR2021★ 4 cited

Geometry of Random Cayley Graphs of Abelian Groups

Jonathan Hermon, Sam Olesker-Taylor

Consider the random Cayley graph of a finite Abelian group with respect to generators chosen uniformly at random, with . Draw a vertex $U \sim \o…

math.PR2020★ 15 cited

Limit Profiles for Reversible Markov Chains

Evita Nestoridi, Sam Olesker-Taylor

In a recent breakthrough, Teyssier [Tey20] introduced a new method for approximating the distance from equilibrium of a random walk on a group. He used it to study the limit profil…

math.PR2018★ 11 cited

Cutoff for Random Walk on Dynamical Erdős--Rényi Graph

Sam Olesker-Taylor, Perla Sousi

We consider dynamical percolation on the complete graph , where each edge refreshes its state at rate , and is then declared open with probability where $λ…