3 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
Multicoloured Hardcore Model: Fast Mixing and Queueing
Sam Olesker-Taylor
We extend the hardcore model to a multicoloured version: a subset of vertices of a graph are coloured such that no vertex is adjacent to one of the same colour; uncoloured vertices…
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…