Sam Thomas

collaborators

4 papers

math.PR2019

Chen--Stein Method for the Uncovered Set of Random Walk on $Z_{n}^{d}$ for $d \geq 3$

Sam Olesker-Taylor, Perla Sousi

Let $X$ be a simple random walk on $Z_{n}^{d}$ with $d \geq 3$ and let $t_{cov}$ be the expected cover time. We consider the set of points $U_{α}$ of $\mathbb{Z}_n…

math.PR2019

Further Results and Discussions on Random Cayley Graphs

Jonathan Hermon, Sam Olesker-Taylor

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 ≪ k ≲ lo g ∣ G ∣$ . The results of this article supp…

math.PR2019

Cutoff for Random Walks on Upper Triangular Matrices

Jonathan Hermon, Sam Olesker-Taylor

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 ≪ lo g k ≪ lo g ∣ G ∣$ (ie $1 ≪ k = ∣ G ∣^{o (1)}$ ). A co…

math.PR2018

Supplementary Material for Random Cayley Graphs Project

Jonathan Hermon, Sam Olesker-Taylor

This document contains supplementary material for the main articles in our Random Cayley Graphs project. We prove refined results about simple random walks on the integers and on t…

Chen--Stein Method for the Uncovered Set of Random Walk on Znd​ for d≥3

Further Results and Discussions on Random Cayley Graphs

Cutoff for Random Walks on Upper Triangular Matrices

Supplementary Material for Random Cayley Graphs Project

Chen--Stein Method for the Uncovered Set of Random Walk on $Z_{n}^{d}$ for $d \geq 3$