Tree builder random walk: recurrence, transience and ballisticity

From MaRDI portal
Publication:2073207



Abstract: The Tree Builder Random Walk is a special random walk that evolves on trees whose size increases with time, randomly and depending upon the walker. After every s steps of the walker, a random number of vertices are added to the tree and attached to the current position of the walker. These processes share similarities with other important classes of markovian and non-markovian random walks presenting a large variety of behaviors according to parameters specifications. We show that for a large and most significant class of tree builder random walks, the process is either null recurrent or transient. If s is odd, the walker is ballistic and thus transient. If s is even, the walker's behavior can be explained from local properties of the growing tree and it can be either null recurrent or it gets trapped on some limited part of the growing tree.


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.











This page was built for publication: Tree builder random walk: recurrence, transience and ballisticity

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