Scaling limit for the cover time of the -biased random walk on a binary tree with <1

DOI10.3150/25-BEJ1897MaRDI QIDQ6839772zbMATH OpenFDO

Authors David A. Croydon

Publication date 24 March 2026

Published in Bernoulli (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/journals/bernoulli/volume-32/issue-2/Scaling-limit-for-the-cover-time-of-the-%ce%bb-biased/10.3150/25-BEJ1897.full

zbMATH Keywords

biased random walkbinary treeCantor setcontinuous-time Markov chaincover timejump processscaling limit

Mathematics Subject Classification ID

Trees (05C05) Sums of independent random variables; random walks (60G50) Continuous-time Markov processes on discrete state spaces (60J27) Jump processes on discrete state spaces (60J74)

This page was built for publication: Scaling limit for the cover time of the \(\lambda \)-biased random walk on a binary tree with \(\lambda <1\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839772)