Scaling limit for the cover time of the λ-biased random walk on a binary tree with λ<1
- 1 May 2026
- journal article
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 32 (2) , 1160-1185
Abstract
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.Keywords
All Related Versions
This publication has 31 references indexed in Scilit:
- A scaling limit for the cover time of the binary treeAdvances in Mathematics, 2021
- A sharp estimate for cover times on binary treesStochastic Processes and their Applications, 2012
- Dirichlet forms and associated heat kernels on the Cantor set induced by random walks on treesAdvances in Mathematics, 2010
- Foundations of Modern Probability2002
- Brownian motion on the continuum treeProbability Theory and Related Fields, 1995
- Harmonic Calculus on Limits of Networks and Its Application to DendritesJournal of Functional Analysis, 1995
- Markov processes on the boundary of the binary tree1992
- Random walk covering of some special treesJournal of Mathematical Analysis and Applications, 1991
- Threshold limits for cover timesJournal of Theoretical Probability, 1991
- Regularity of gaussian processesActa Mathematica, 1987