David A. Croydon
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
David A. Croydon has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Takashi Kumagai
Department of Mathematics Waseda University 3-4-1 Okubo Shinjuku-ku 169-8555 Tokyo Japan
9 shared publications - Makiko Sasada
Graduate School of Mathematical Sciences, University of Tokyo, Tokyo, Japan
8 shared publications - Ben Hambly
University of Oxford
5 shared publications - Daisuke Shiraishi
Graduate School of Informatics Kyoto University
3 shared publications - Satoshi Tsujimoto
Graduate School of Informatics, Kyoto University, Kyoto, Japan
3 shared publications - Stephen Muirhead
School of Mathematics and Statistics, University of Melbourne
3 shared publications
Latest Publications
- 1 May 2026
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 32 (2) , 1160-1185
Scaling limit for the cover time of the λ-biased random walk on a binary tree with λ<1
The λ-biased random walk on a binary tree of depth n is the continuous-time Markov chain that has unit mean holding times and, when at a vertex other than the root or a leaf of the tree in question, has a probability of jumping to the parent vertex that is λ times the probability of jumping to a particular child. (From the root, it chooses one of the two children with equal probability.) For this process, when λ<1, we derive an n→∞ scaling limit for the cover time, that is, the time taken to visit every vertex. The distributional limit is described in terms of a jump process on a Cantor set that can be seen as the asymptotic boundary of the tree. This conclusion complements previous results obtained when λ≥1.
- 1 May 2026
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 32 (2) , 1160-1185
Scaling limit for the cover time of the λ-biased random walk on a binary tree with λ<1
The λ-biased random walk on a binary tree of depth n is the continuous-time Markov chain that has unit mean holding times and, when at a vertex other than the root or a leaf of the tree in question, has a probability of jumping to the parent vertex that is λ times the probability of jumping to a particular child. (From the root, it chooses one of the two children with equal probability.) For this process, when λ<1, we derive an n→∞ scaling limit for the cover time, that is, the time taken to visit every vertex. The distributional limit is described in terms of a jump process on a Cantor set that can be seen as the asymptotic boundary of the tree. This conclusion complements previous results obtained when λ≥1.
- Open Access
Scaling limit for Brownian motions on the $l$-level Sierpinski gaskets: The fractal to Euclidean crossover
In two dimensions, the $l$-level Sierpinski gasket $\mathrm{SG}(l)$ is obtained by splitting an equilateral triangle into a collection of $l^2$ equilateral triangles of equal size and with the same total area, retaining only the $l(l+1)/2$ triangles with the same orientation as the original triangle, and then iterating this procedure indefinitely. We show that the canonical diffusions on the spaces $\mathrm{SG}(l)$, $l\geq2$, can be rescaled to yield Brownian motion on the initial triangle. Our argument also applies to the analogous higher-dimensional Sierpinski gaskets. Moreover, we prove a local central limit theorem for the associated transition densities. Key to this is the derivation of a Poincaré inequality, in the proof of which we exploit the Euclidean-type mixing that occurs between the bottlenecks present at each scale of the fractal.Open AccessScaling limit for Brownian motions on the $l$-level Sierpinski gaskets: The fractal to Euclidean crossover
In two dimensions, the $l$-level Sierpinski gasket $\mathrm{SG}(l)$ is obtained by splitting an equilateral triangle into a collection of $l^2$ equilateral triangles of equal size and with the same total area, retaining only the $l(l+1)/2$ triangles with the same orientation as the original triangle, and then iterating this procedure indefinitely. We show that the canonical diffusions on the spaces $\mathrm{SG}(l)$, $l\geq2$, can be rescaled to yield Brownian motion on the initial triangle. Our argument also applies to the analogous higher-dimensional Sierpinski gaskets. Moreover, we prove a local central limit theorem for the associated transition densities. Key to this is the derivation of a Poincaré inequality, in the proof of which we exploit the Euclidean-type mixing that occurs between the bottlenecks present at each scale of the fractal. - Open Access
- 28 January 2025
- Published by Qeios Ltd
Review of: "Aspects of a Randomly Growing Cluster in ℝ^2, d≥2"
As already noted in other reviews, this paper introduces a model of a growing structure that is a Euclidean embedding of a random recursive tree, with the main results being estimates on the resulting cluster's diameter and the total length of the as...
- 28 January 2025
- Published by Qeios Ltd
Open AccessReview of: "Aspects of a Randomly Growing Cluster in ℝ^2, d≥2"
As already noted in other reviews, this paper introduces a model of a growing structure that is a Euclidean embedding of a random recursive tree, with the main results being estimates on the resulting cluster's diameter and the total length of the as...
- Open Access
Triple collisions on a comb graph
In this article, we consider the number of collisions of three independent simple random walks on a subgraph of the two-dimensional square lattice obtained by removing all horizontal edges with vertical coordinate not equal to 0 and then, for $n\in \mathbb{Z}$, restricting the vertical segment of the graph located at horizontal coordinate $n$ to the interval $\{0,1,\dots,\log^α(|n|\vee 1)\}$. Specifically, we show the following phase transition: when $α\leq 1$, the three random walks collide infinitely many times almost-surely, whereas when $α>1$, they collide only finitely many times almost-surely. This is a variation of a result of Barlow, Peres and Sousi, who showed a similar phase transition for two random walks when the vertical segments are truncated at height $|n|^α$.Open AccessTriple collisions on a comb graph
In this article, we consider the number of collisions of three independent simple random walks on a subgraph of the two-dimensional square lattice obtained by removing all horizontal edges with vertical coordinate not equal to 0 and then, for $n\in \mathbb{Z}$, restricting the vertical segment of the graph located at horizontal coordinate $n$ to the interval $\{0,1,\dots,\log^α(|n|\vee 1)\}$. Specifically, we show the following phase transition: when $α\leq 1$, the three random walks collide infinitely many times almost-surely, whereas when $α>1$, they collide only finitely many times almost-surely. This is a variation of a result of Barlow, Peres and Sousi, who showed a similar phase transition for two random walks when the vertical segments are truncated at height $|n|^α$. - Open Access
On the cover time of Brownian motion on the Brownian continuum random tree
Upon almost-every realisation of the Brownian continuum random tree (CRT), it is possible to define a canonical diffusion process or `Brownian motion'. The main result of this article establishes that the cover time of the Brownian motion on the Brownian CRT (i.e.\ the time taken by the process in question to visit the entire state space) is equal to the infimum over the times at which the associated local times are strictly positive everywhere. The proof of this result depends on the recursive self-similarity of the Brownian CRT and a novel version of the first Ray-Knight theorem for trees, which is of independent interest. As a consequence, we obtain that the suitably-rescaled cover times of simple random walks on critical, finite variance Galton-Watson trees converge in distribution with respect to their annealed laws to the cover time of Brownian motion on the Brownian CRT. Other families of graphs that have the Brownian CRT as a scaling limit are also covered. Additionally, we partially confirm a 1991 conjecture of David Aldous regarding related cover-and-return times.
Open AccessOn the cover time of Brownian motion on the Brownian continuum random tree
Upon almost-every realisation of the Brownian continuum random tree (CRT), it is possible to define a canonical diffusion process or `Brownian motion'. The main result of this article establishes that the cover time of the Brownian motion on the Brownian CRT (i.e.\ the time taken by the process in question to visit the entire state space) is equal to the infimum over the times at which the associated local times are strictly positive everywhere. The proof of this result depends on the recursive self-similarity of the Brownian CRT and a novel version of the first Ray-Knight theorem for trees, which is of independent interest. As a consequence, we obtain that the suitably-rescaled cover times of simple random walks on critical, finite variance Galton-Watson trees converge in distribution with respect to their annealed laws to the cover time of Brownian motion on the Brownian CRT. Other families of graphs that have the Brownian CRT as a scaling limit are also covered. Additionally, we partially confirm a 1991 conjecture of David Aldous regarding related cover-and-return times.
- Open Access
Heat kernel fluctuations and quantitative homogenization for the one-dimensional Bouchaud trap model
We present on-diagonal heat kernel estimates and quantitative homogenization statements for the one-dimensional Bouchaud trap model. The heat kernel estimates are obtained using standard techniques, with key inputs coming from a careful analysis of the volume growth of the invariant measure of the process under study. As for the quantitative homogenization results, these include both quenched and annealed Berry-Esseen-type theorems, as well as a quantitative quenched local limit theorem. Whilst the model we study here is a particularly simple example of a random walk in a random environment, we believe the roadmap we provide for establishing the latter result in particular will be useful for deriving quantitative local limit theorems in other, more challenging, settings.
Open AccessHeat kernel fluctuations and quantitative homogenization for the one-dimensional Bouchaud trap model
We present on-diagonal heat kernel estimates and quantitative homogenization statements for the one-dimensional Bouchaud trap model. The heat kernel estimates are obtained using standard techniques, with key inputs coming from a careful analysis of the volume growth of the invariant measure of the process under study. As for the quantitative homogenization results, these include both quenched and annealed Berry-Esseen-type theorems, as well as a quantitative quenched local limit theorem. Whilst the model we study here is a particularly simple example of a random walk in a random environment, we believe the roadmap we provide for establishing the latter result in particular will be useful for deriving quantitative local limit theorems in other, more challenging, settings.
- Open Access
Aging and sub-aging for one-dimensional random walks amongst random conductances
We consider random walks amongst random conductances in the cases where the conductances can be arbitrarily small, with a heavy-tailed distribution at 0, and where the conductances may or may not have a heavy-tailed distribution at infinity. We study the long time behaviour of these processes and prove aging statements. When the heavy tail is only at 0, we prove that aging can be observed for the maximum of the process, i.e. the same maximal value is attained repeatedly over long time-scales. When there are also heavy tails at infinity, we prove a classical aging result for the position of the walker, as well as a sub-aging result that occurs on a shorter time-scale.
Open AccessAging and sub-aging for one-dimensional random walks amongst random conductances
We consider random walks amongst random conductances in the cases where the conductances can be arbitrarily small, with a heavy-tailed distribution at 0, and where the conductances may or may not have a heavy-tailed distribution at infinity. We study the long time behaviour of these processes and prove aging statements. When the heavy tail is only at 0, we prove that aging can be observed for the maximum of the process, i.e. the same maximal value is attained repeatedly over long time-scales. When there are also heavy tails at infinity, we prove a classical aging result for the position of the walker, as well as a sub-aging result that occurs on a shorter time-scale.
- Open Access
Annealed transition density of simple random walk on a high-dimensional loop-erased random walk
We derive sub-Gaussian bounds for the annealed transition density of the simple random walk on a high-dimensional loop-erased random walk. The walk dimension that appears in these is the exponent governing the space-time scaling of the process with respect to the extrinsic Euclidean distance, which contrasts with the exponent given by the intrinsic graph distance that appears in the corresponding quenched bounds. We prove our main result using novel pointwise Gaussian estimates on the distribution of the high-dimensional loop-erased random walk.
Open AccessAnnealed transition density of simple random walk on a high-dimensional loop-erased random walk
We derive sub-Gaussian bounds for the annealed transition density of the simple random walk on a high-dimensional loop-erased random walk. The walk dimension that appears in these is the exponent governing the space-time scaling of the process with respect to the extrinsic Euclidean distance, which contrasts with the exponent given by the intrinsic graph distance that appears in the corresponding quenched bounds. We prove our main result using novel pointwise Gaussian estimates on the distribution of the high-dimensional loop-erased random walk.
- Open Access
Scaling limit of critical percolation clusters on hyperbolic random half-planar triangulations and the associated random walks
We show that the Gromov-Hausdorff-Prohorov scaling limit of a critical percolation cluster on a random hyperbolic triangulation of the half-plane is the Brownian continuum random tree. As a corollary, we obtain that a simple random walk on the critical cluster rescales to Brownian motion on the continuum random tree.
Open AccessScaling limit of critical percolation clusters on hyperbolic random half-planar triangulations and the associated random walks
We show that the Gromov-Hausdorff-Prohorov scaling limit of a critical percolation cluster on a random hyperbolic triangulation of the half-plane is the Brownian continuum random tree. As a corollary, we obtain that a simple random walk on the critical cluster rescales to Brownian motion on the continuum random tree.
- Open Access
Heat kernel fluctuations for stochastic processes on fractals and random media
It is well-known that stochastic processes on fractal spaces or in certain random media exhibit anomalous heat kernel behaviour. One manifestation of such irregular behaviour is the presence of fluctuations in the short- or long-time asymptotics of the on-diagonal heat kernel. In this note we review some examples for which such fluctuations are known to occur, including Brownian motion on certain deterministic or random fractals, and simple random walks on various examples of random graph trees, such as the incipient infinite cluster of critical percolation on a regular tree and low-dimensional uniform spanning trees. We also announce some new results that add the one-dimensional Bouchaud trap model to this class of examples.
Open AccessHeat kernel fluctuations for stochastic processes on fractals and random media
It is well-known that stochastic processes on fractal spaces or in certain random media exhibit anomalous heat kernel behaviour. One manifestation of such irregular behaviour is the presence of fluctuations in the short- or long-time asymptotics of the on-diagonal heat kernel. In this note we review some examples for which such fluctuations are known to occur, including Brownian motion on certain deterministic or random fractals, and simple random walks on various examples of random graph trees, such as the incipient infinite cluster of critical percolation on a regular tree and low-dimensional uniform spanning trees. We also announce some new results that add the one-dimensional Bouchaud trap model to this class of examples.