Tree builder random walk: recurrence, transience and ballisticity (Q2073207)

The authors considered a tree builder random walk (TBRW), which evolves on trees whose size increases randomly with time. Namely, given a parameter \(s\in \mathbb N\) of the model, after every \(s\) transitions of the walker a random number of vertices are added to the tree and attached to the current position of the random walk. It proved that for a large and most significant class of TBRWs, the process is either null recurrent or transient. Moreover, if \(s\) is odd then the walker is ballistic, thus transient; if \(s\) is even then the walker's behavior depends from local properties of the growing tree: it can be either null recurrent or it gets trapped on some limited part of the growing tree.