Scaling limit for the cover time of the λ-biased random walk on a binary tree with λ<1
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 λ
Fields of Study & Subjects
Stochastic processes and statistical mechanics
Mathematical Dynamics and Fractals
advanced mathematical theories
Publication details
- Journal / source
- Bernoulli
- Volume
- 32
- Issue
- 2
- Pages
- 1160–1185
- Publication date
- 29 January 2026
- Language
- EN