Sam Olesker-Taylor
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Sam Olesker-Taylor has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Jonathan Hermon
University of British Columbia, Vancouver, Canada
5 shared publications - Evita Nestoridi
Princeton University, Princeton, USA
3 shared publications - Perla Sousi
University of Cambridge Cambridge UK
2 shared publications - Brett Kolesnik
Department of Statistics, University of Warwick, Coventry, UK
1 shared publication - Bruno Schapira
CNRS, I2M, UMR 7373, Aix-Marseille Université, Marseille, France
1 shared publication Daniel Bearup
University of Leicester
1 shared publication
Latest Publications
- 1 June 2026
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 36 (3) , 2852-2872
Limit profile for the Bernoulli–Laplace urn via diffusions
We introduce a technique to establish limit profiles for Markov chains by leveraging tools from stochastic analysis—in particular, approximations via SDEs. We demonstrate our arguments by analysing the Bernoulli–Laplace urn model: ∙ initially, one urn contains k red balls and a second n−k blue balls; ∙ in each step, a pair of balls is chosen uniform and their locations are switched. Cutoff is known to occur at 12nlogmin{k,n} with window order n whenever 1≪k≤12n. We refine this by determining the limit profile: a function Φ such that dTV(1 2nlogmin{k, n}+θn)→Φ(θ)asn→∞for allθ∈R. Its birth–death representation approximates an Ornstein–Uhlenbeck diffusion, once appropriately rescaled, started from the bulk (according to its equilibrium distribution), when k≫n. Precise concentration results as the chain enters the bulk are needed. We also establish the limit profile when 1≪k≲n, via a different method.
- 1 June 2026
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 36 (3) , 2852-2872
Limit profile for the Bernoulli–Laplace urn via diffusions
We introduce a technique to establish limit profiles for Markov chains by leveraging tools from stochastic analysis—in particular, approximations via SDEs. We demonstrate our arguments by analysing the Bernoulli–Laplace urn model: ∙ initially, one urn contains k red balls and a second n−k blue balls; ∙ in each step, a pair of balls is chosen uniform and their locations are switched. Cutoff is known to occur at 12nlogmin{k,n} with window order n whenever 1≪k≤12n. We refine this by determining the limit profile: a function Φ such that dTV(1 2nlogmin{k, n}+θn)→Φ(θ)asn→∞for allθ∈R. Its birth–death representation approximates an Ornstein–Uhlenbeck diffusion, once appropriately rescaled, started from the bulk (according to its equilibrium distribution), when k≫n. Precise concentration results as the chain enters the bulk are needed. We also establish the limit profile when 1≪k≲n, via a different method.
- Top Cited Papers
- 2 February 2026
- Published by European Mathematical Society - EMS - Publishing House GmbH in Journal of the European Mathematical Society
- Vol. 28 (5) , 1913-1977
Cutoff for almost all random walks on Abelian groups
Consider the random Cayley graph of a finite group G with respect to k generators chosen uniformly at random, with 1 \ll \log k \ll{\log}|G| ; denote it by G_{k} . A conjecture of Aldous and Diaconis (1985) asserts, for k \gg{\log}|G| , that the random walk on this graph exhibits cutoff. Further, the cutoff time should be a function only of k and |G| , to sub-leading order. This was verified for all Abelian groups in the ’90s. We extend the conjecture to 1 \ll k \lesssim{\log}|G| . We establish cutoff for all Abelian groups under the condition k - d(G) \gg 1 , where d(G) is the minimal size of a generating subset of G , which is almost optimal. The cutoff time is described (abstractly) in terms of the entropy of random walk on \mathbb{Z}^{k} . This abstract definition allows us to deduce that the cutoff time can be written as a function only of k and |G| when d(G) \ll{\log}|G| and k - d(G) \asymp k \gg 1 ; this is not the case when d(G) \asymp{\log}|G| \asymp k . For certain regimes of k , we find the limit profile of the convergence to equilibrium. Wilson (1997) conjectured that \mathbb{Z}_{2}^{d} gives rise to the slowest mixing time for G_{k} amongst all groups of size at most 2^{d} . We give a partial answer, verifying the conjecture for nilpotent groups. This is obtained via a comparison result of independent interest between the mixing times of nilpotent G and a corresponding Abelian group \overline G , namely the direct sum of the Abelian quotients in the lower central series of G . We use this to refine a celebrated result of Alon and Roichman 1994: we show for nilpotent G that G_{k} is an expander provided k - d(\overline G) \gtrsim{\log}|G| . As another consequence, we establish cutoff for nilpotent groups with relatively small commutator subgroup, including high-dimensional special groups, such as Heisenberg groups. The aforementioned results all hold with high probability over the random Cayley graph G_{k} .
- 2 February 2026
- Published by European Mathematical Society - EMS - Publishing House GmbH in Journal of the European Mathematical Society
- Vol. 28 (5) , 1913-1977
Top Cited PapersCutoff for almost all random walks on Abelian groups
Consider the random Cayley graph of a finite group G with respect to k generators chosen uniformly at random, with 1 \ll \log k \ll{\log}|G| ; denote it by G_{k} . A conjecture of Aldous and Diaconis (1985) asserts, for k \gg{\log}|G| , that the random walk on this graph exhibits cutoff. Further, the cutoff time should be a function only of k and |G| , to sub-leading order. This was verified for all Abelian groups in the ’90s. We extend the conjecture to 1 \ll k \lesssim{\log}|G| . We establish cutoff for all Abelian groups under the condition k - d(G) \gg 1 , where d(G) is the minimal size of a generating subset of G , which is almost optimal. The cutoff time is described (abstractly) in terms of the entropy of random walk on \mathbb{Z}^{k} . This abstract definition allows us to deduce that the cutoff time can be written as a function only of k and |G| when d(G) \ll{\log}|G| and k - d(G) \asymp k \gg 1 ; this is not the case when d(G) \asymp{\log}|G| \asymp k . For certain regimes of k , we find the limit profile of the convergence to equilibrium. Wilson (1997) conjectured that \mathbb{Z}_{2}^{d} gives rise to the slowest mixing time for G_{k} amongst all groups of size at most 2^{d} . We give a partial answer, verifying the conjecture for nilpotent groups. This is obtained via a comparison result of independent interest between the mixing times of nilpotent G and a corresponding Abelian group \overline G , namely the direct sum of the Abelian quotients in the lower central series of G . We use this to refine a celebrated result of Alon and Roichman 1994: we show for nilpotent G that G_{k} is an expander provided k - d(\overline G) \gtrsim{\log}|G| . As another consequence, we establish cutoff for nilpotent groups with relatively small commutator subgroup, including high-dimensional special groups, such as Heisenberg groups. The aforementioned results all hold with high probability over the random Cayley graph G_{k} .
- 12 August 2025
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 195 (1-2) , 413-449
Catalan percolation
- 12 August 2025
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 195 (1-2) , 413-449
Catalan percolation
- Open Access
- 3 February 2025
- Published by Cambridge University Press (CUP) in Mathematics in Industry Repository
Non-contact ultrasound testing of batteries
Hy-Met are a company using ultrasound for non-destructive testing of batteries. These ultrasound signals contain information on the health of a battery. Hy-Met aim to understand real acoustic data. However, data for particular defects is scarce. The challenge is to understand the reflection and transmission of ultrasound signals within the layers of battery, especially with defects present in certain regions of the battery. In this report, we seek to (i) understand properties of current models, (ii) apply data analysis techniques to extract relevant features from real data, (iii) understand reflection and transmission via probabilistic and combinatorial models. These may lead to the generation of synthetic data for further analysis and training.
- 3 February 2025
- Published by Cambridge University Press (CUP) in Mathematics in Industry Repository
Open AccessNon-contact ultrasound testing of batteries
Hy-Met are a company using ultrasound for non-destructive testing of batteries. These ultrasound signals contain information on the health of a battery. Hy-Met aim to understand real acoustic data. However, data for particular defects is scarce. The challenge is to understand the reflection and transmission of ultrasound signals within the layers of battery, especially with defects present in certain regions of the battery. In this report, we seek to (i) understand properties of current models, (ii) apply data analysis techniques to extract relevant features from real data, (iii) understand reflection and transmission via probabilistic and combinatorial models. These may lead to the generation of synthetic data for further analysis and training.
- Open Access
Time-Biased Random Walks and Robustness of Expanders
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 are rapidly mixing, which is equivalent to having a spectral gap $γ$ (asymptotically) bounded away from $0$. Our work has two main strands. First, we establish a dichotomy for the robustness of mixing times on edge-weighted $d$-regular graphs (i.e., reversible Markov chains) subject to a Lipschitz condition, which bounds the ratio of adjacent weights by $β\geq 1$. If $β\ge 1$ is sufficiently small, then $γ\asymp 1$ and the mixing time is logarithmic in $n$. On the other hand, if $β\geq 2d$, there is an edge-weighting such that $γ$ is polynomially small in $1/n$. Second, we apply our robustness result to a time-dependent version of the so-called $\varepsilon$-biased random walk, as introduced in Azar et al. [Combinatorica 1996]. We show that, for any constant $\varepsilon>0$, a bias strategy can be chosen adaptively so that the $\varepsilon$-biased random walk covers any bounded-degree regular expander in $Θ(n)$ expected time, improving the previous-best bound of $O(n \log \log n)$. We prove the first non-trivial lower bound on the cover time of the $\varepsilon$-biased random walk, showing that, on bounded-degree regular expanders, it is $ω(n)$ whenever $\varepsilon = o(1)$. We establish this by controlling how much the probability of arbitrary events can be ``boosted'' by using a time-dependent bias strategy.Open AccessTime-Biased Random Walks and Robustness of Expanders
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 are rapidly mixing, which is equivalent to having a spectral gap $γ$ (asymptotically) bounded away from $0$. Our work has two main strands. First, we establish a dichotomy for the robustness of mixing times on edge-weighted $d$-regular graphs (i.e., reversible Markov chains) subject to a Lipschitz condition, which bounds the ratio of adjacent weights by $β\geq 1$. If $β\ge 1$ is sufficiently small, then $γ\asymp 1$ and the mixing time is logarithmic in $n$. On the other hand, if $β\geq 2d$, there is an edge-weighting such that $γ$ is polynomially small in $1/n$. Second, we apply our robustness result to a time-dependent version of the so-called $\varepsilon$-biased random walk, as introduced in Azar et al. [Combinatorica 1996]. We show that, for any constant $\varepsilon>0$, a bias strategy can be chosen adaptively so that the $\varepsilon$-biased random walk covers any bounded-degree regular expander in $Θ(n)$ expected time, improving the previous-best bound of $O(n \log \log n)$. We prove the first non-trivial lower bound on the cover time of the $\varepsilon$-biased random walk, showing that, on bounded-degree regular expanders, it is $ω(n)$ whenever $\varepsilon = o(1)$. We establish this by controlling how much the probability of arbitrary events can be ``boosted'' by using a time-dependent bias strategy. - Open Access
- 30 January 2024
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 188 (3-4) , 1017-1062
Geometric bounds on the fastest mixing Markov chain
In the Fastest Mixing Markov Chain problem, we are given a graph $$G = (V, E)$$ and desire the discrete-time Markov chain with smallest mixing time $$\tau $$ subject to having equilibrium distribution uniform on V and non-zero transition probabilities only across edges of the graph. It is well-known that the mixing time $$\tau _\textsf {RW}$$ of the lazy random walk on G is characterised by the edge conductance $$\Phi $$ of G via Cheeger’s inequality: $$\Phi ^{-1} \lesssim \tau _\textsf {RW} \lesssim \Phi ^{-2} \log |V|$$ . Analogously, we characterise the fastest mixing time $$\tau ^\star $$ via a Cheeger-type inequality but for a different geometric quantity, namely the vertex conductance $$\Psi $$ of G: $$\Psi ^{-1} \lesssim \tau ^\star \lesssim \Psi ^{-2} (\log |V|)^2$$ . This characterisation forbids fast mixing for graphs with small vertex conductance. To bypass this fundamental barrier, we consider Markov chains on G with equilibrium distribution which need not be uniform, but rather only $$\varepsilon $$ -close to uniform in total variation. We show that it is always possible to construct such a chain with mixing time $$\tau \lesssim \varepsilon ^{-1} ({\text {diam}} G)^2 \log |V|$$ . Finally, we discuss analogous questions for continuous-time and time-inhomogeneous chains.- 30 January 2024
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 188 (3-4) , 1017-1062
Open AccessGeometric bounds on the fastest mixing Markov chain
In the Fastest Mixing Markov Chain problem, we are given a graph $$G = (V, E)$$ and desire the discrete-time Markov chain with smallest mixing time $$\tau $$ subject to having equilibrium distribution uniform on V and non-zero transition probabilities only across edges of the graph. It is well-known that the mixing time $$\tau _\textsf {RW}$$ of the lazy random walk on G is characterised by the edge conductance $$\Phi $$ of G via Cheeger’s inequality: $$\Phi ^{-1} \lesssim \tau _\textsf {RW} \lesssim \Phi ^{-2} \log |V|$$ . Analogously, we characterise the fastest mixing time $$\tau ^\star $$ via a Cheeger-type inequality but for a different geometric quantity, namely the vertex conductance $$\Psi $$ of G: $$\Psi ^{-1} \lesssim \tau ^\star \lesssim \Psi ^{-2} (\log |V|)^2$$ . This characterisation forbids fast mixing for graphs with small vertex conductance. To bypass this fundamental barrier, we consider Markov chains on G with equilibrium distribution which need not be uniform, but rather only $$\varepsilon $$ -close to uniform in total variation. We show that it is always possible to construct such a chain with mixing time $$\tau \lesssim \varepsilon ^{-1} ({\text {diam}} G)^2 \log |V|$$ . Finally, we discuss analogous questions for continuous-time and time-inhomogeneous chains. - Open Access
- 1 January 2024
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 29 (none) , 1-22
Limit profiles for projections of random walks on groups
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 determining not only the existence of cutoff and the order of its mixing time and window, but the exact shape, or profile, of the convergence inside the window. Classical techniques, such as coupling or ℓ2-bounds, are typically too crude to establish this and there has been a push to develop general techniques [27, 21, 20]. We build upon this work, extending from conjugacy-invariant random walks on groups to certain projections. We exemplify our method by analysing the k-particle interchange process on the complete n-graph with k≍n. This is a projection of the random-transposition card shuffle, which corresponds to k=n, analysed in [27].
- 1 January 2024
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 29 (none) , 1-22
Open AccessLimit profiles for projections of random walks on groups
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 determining not only the existence of cutoff and the order of its mixing time and window, but the exact shape, or profile, of the convergence inside the window. Classical techniques, such as coupling or ℓ2-bounds, are typically too crude to establish this and there has been a push to develop general techniques [27, 21, 20]. We build upon this work, extending from conjugacy-invariant random walks on groups to certain projections. We exemplify our method by analysing the k-particle interchange process on the complete n-graph with k≍n. This is a projection of the random-transposition card shuffle, which corresponds to k=n, analysed in [27].
- 1 October 2023
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 33 (5) , 3520-3562
Geometry of random Cayley graphs of Abelian groups
Consider the random Cayley graph of a finite Abelian group G with respect to k generators chosen uniformly at random, with 1≪logk≪log|G|. Draw a vertex U∼Unif(G). We show that the graph distance dist(id,U) from the identity to U concentrates at a particular value M, which is the minimal radius of a ball in Zk of cardinality at least |G|, under mild conditions. In other words, the distance from the identity for all but o(|G|) of the elements of G lies in the interval [M−o(M),M+o(M)]. In the regime k≳log|G|, we show that the diameter of the graph is also asymptotically M. In the spirit of a conjecture of Aldous and Diaconis (Technical Report 231 (1985)), this M depends only on k and |G|, not on the algebraic structure of G. Write d(G) for the minimal size of a generating subset of G. We prove that the order of the spectral gap is |G|−2/k when k−d(G)≍k and |G| lies in a density-1 subset of N or when k−2d(G)≍k. This extends, for Abelian groups, a celebrated result of Alon and Roichman (Random Structures Algorithms 5 (1994) 271–284). The aforementioned results all hold with high probability over the random Cayley graph.
- 1 October 2023
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 33 (5) , 3520-3562
Geometry of random Cayley graphs of Abelian groups
Consider the random Cayley graph of a finite Abelian group G with respect to k generators chosen uniformly at random, with 1≪logk≪log|G|. Draw a vertex U∼Unif(G). We show that the graph distance dist(id,U) from the identity to U concentrates at a particular value M, which is the minimal radius of a ball in Zk of cardinality at least |G|, under mild conditions. In other words, the distance from the identity for all but o(|G|) of the elements of G lies in the interval [M−o(M),M+o(M)]. In the regime k≳log|G|, we show that the diameter of the graph is also asymptotically M. In the spirit of a conjecture of Aldous and Diaconis (Technical Report 231 (1985)), this M depends only on k and |G|, not on the algebraic structure of G. Write d(G) for the minimal size of a generating subset of G. We prove that the order of the spectral gap is |G|−2/k when k−d(G)≍k and |G| lies in a density-1 subset of N or when k−2d(G)≍k. This extends, for Abelian groups, a celebrated result of Alon and Roichman (Random Structures Algorithms 5 (1994) 271–284). The aforementioned results all hold with high probability over the random Cayley graph.
- Open Access
Limit Profile for Projections of Random Walks on Groups
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 determining not only the existence of cutoff and the order of its mixing time and window, but the exact shape, or profile, of the convergence inside the window. Classical techniques, such as coupling or $\ell_2$-bounds, are typically too crude to establish this and there has been a push to develop general techniques. We build upon this work, extending from conjugacy-invariant random walks on groups to certain projections. We exemplify our method by analysing the $k$-particle interchange process on the complete $n$-graph with $k \asymp n$. This is a projection of the random-transpositions card shuffle, which corresponds to $k = n$, analysed by Teyssier.Open AccessLimit Profile for Projections of Random Walks on Groups
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 determining not only the existence of cutoff and the order of its mixing time and window, but the exact shape, or profile, of the convergence inside the window. Classical techniques, such as coupling or $\ell_2$-bounds, are typically too crude to establish this and there has been a push to develop general techniques. We build upon this work, extending from conjugacy-invariant random walks on groups to certain projections. We exemplify our method by analysing the $k$-particle interchange process on the complete $n$-graph with $k \asymp n$. This is a projection of the random-transpositions card shuffle, which corresponds to $k = n$, analysed by Teyssier. - Open Access
Cutoff for Rewiring Dynamics on Perfect Matchings
We establish cutoff for a natural random walk (RW) on the set of perfect matchings (PMs). An $n$-PM is a pairing of $2n$ objects. The $k$-PM RW selects $k$ pairs uniformly at random, disassociates the corresponding $2k$ objects, then chooses a new pairing on these $2k$ objects uniformly at random. The equilibrium distribution is uniform over the set of all $n$-PM. We establish cutoff for the $k$-PM RW whenever $2 \le k \ll n$. If $k \gg 1$, then the mixing time is $\tfrac nk \log n$ to leading order. The case $k = 2$ was established by Diaconis and Holmes (2002) by relating the $2$-PM RW to the random transpositions card shuffle and also by Ceccherini-Silberstein, Scarabotti and Tolli (2007, 2008) using representation theory. We are the first to handle $k > 2$. Our argument builds on previous work of Berestycki, Schramm, \c{S}eng\"ul and Zeitouni (2005, 2011, 2019) regarding conjugacy-invariant RWs on the permutation group.Open AccessCutoff for Rewiring Dynamics on Perfect Matchings
We establish cutoff for a natural random walk (RW) on the set of perfect matchings (PMs). An $n$-PM is a pairing of $2n$ objects. The $k$-PM RW selects $k$ pairs uniformly at random, disassociates the corresponding $2k$ objects, then chooses a new pairing on these $2k$ objects uniformly at random. The equilibrium distribution is uniform over the set of all $n$-PM. We establish cutoff for the $k$-PM RW whenever $2 \le k \ll n$. If $k \gg 1$, then the mixing time is $\tfrac nk \log n$ to leading order. The case $k = 2$ was established by Diaconis and Holmes (2002) by relating the $2$-PM RW to the random transpositions card shuffle and also by Ceccherini-Silberstein, Scarabotti and Tolli (2007, 2008) using representation theory. We are the first to handle $k > 2$. Our argument builds on previous work of Berestycki, Schramm, \c{S}eng\"ul and Zeitouni (2005, 2011, 2019) regarding conjugacy-invariant RWs on the permutation group.