8 citations · 8 across the 3 of their papers we have counts for
3 papers
cs.DS2025
A Randomised Approach to Distributed Sorting
Sam Olesker-Taylor
We introduce and analyse a new, extremely simple, randomised sorting algorithm: - choose a pair of indices according to some distribution ; - sort the elements in pos…
math.PR2024
An Analysis of Elo Rating Systems via Markov Chains
Sam Olesker-Taylor, Luca Zanetti
We present a theoretical analysis of the Elo rating system, a popular method for ranking skills of players in an online setting. In particular, we study Elo under the Bradley--Terr…
math.PR2021★ 8 cited
Geometric Bounds on the Fastest Mixing Markov Chain
Sam Olesker-Taylor, Luca Zanetti
In the Fastest Mixing Markov Chain problem, we are given a graph and desire the discrete-time Markov chain with smallest mixing time subject to having equilibrium…