# Cover time for branching random walks on regular trees

Research output: Contribution to journalArticlepeer-review

## Abstract

Let T be the regular tree in which every vertex has exactly <![CDATA[ $d\ge 3$ ]]> neighbours. Run a branching random walk on T, in which at each time step every particle gives birth to a random number of children with mean d and finite variance, and each of these children moves independently to a uniformly chosen neighbour of its parent. We show that, starting with one particle at some vertex 0 and conditionally on survival of the process, the time it takes for every vertex within distance r of 0 to be hit by a particle of the branching random walk is <![CDATA[ $r + ({2}/{\log(3/2)})\log\log r + {\mathrm{o}}(\log\log r)$ ]]>.

Original language English 256-277 Journal of Applied Probability 59 1 9 Feb 2022 https://doi.org/10.1017/jpr.2021.46 Published - 31 Mar 2022

## Keywords

• Branching random walk
• cover time
• rightmost particle
• tree

## ASJC Scopus subject areas

• Statistics and Probability
• Mathematics(all)
• Statistics, Probability and Uncertainty

## Fingerprint

Dive into the research topics of 'Cover time for branching random walks on regular trees'. Together they form a unique fingerprint.