Translator Disclaimer
2021 On a random walk that grows its own tree
Daniel Figueiredo, Giulio Iacobelli, Roberto Oliveira, Bruce Reed, Rodrigo Ribeiro
Electron. J. Probab. 26: 1-40 (2021). DOI: 10.1214/20-EJP574

Abstract

Random walks on dynamic graphs have received increasingly more attention from different academic communities over the last decade. Despite the relatively large literature, little is known about random walks that construct the graph where they walk while moving around. In this paper we study one of the simplest conceivable discrete time models of this kind, which works as follows: before every walker step, with probability $p$ a new leaf is added to the vertex currently occupied by the walker. The model grows trees and we call it the Bernoulli Growth Random Walk (BGRW). We show that the BGRW walker is transient and has a well-defined linear speed $c(p)>0$ for any $0<p\leq 1$. Moreover, we show that the tree as seen by the walker converges (in a suitable sense) to a random tree that is one-ended. Some natural open problems about this tree and variants of our model are collected at the end of the paper.

Citation

Download Citation

Daniel Figueiredo. Giulio Iacobelli. Roberto Oliveira. Bruce Reed. Rodrigo Ribeiro. "On a random walk that grows its own tree." Electron. J. Probab. 26 1 - 40, 2021. https://doi.org/10.1214/20-EJP574

Information

Received: 12 May 2020; Accepted: 17 December 2020; Published: 2021
First available in Project Euclid: 7 January 2021

Digital Object Identifier: 10.1214/20-EJP574

Subjects:
Primary: 60K35, 60K35, 60K35

JOURNAL ARTICLE
40 PAGES


SHARE
Vol.26 • 2021
Back to Top