Papers › Renewal structure of the Tree Builder Random Walk
Renewal structure of the Tree Builder Random Walk
Rodrigo Ribeiro
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper, we study a class of random walks that build their own tree. At each step, the walker attaches a random number of leaves to its current position. The model can be seen as a subclass of the Random Walk in Changing Environments (RWCE) introduced by G. Amir, I. Benjamini, O. Gurel-Gurevich and G. Kozma. We develop a renewal framework for the process analogous to that established by A-S. Sznitman and M. Zerner in the context of RWRE. This provides a more robust foundation for analyzing the model. As a result of our renewal framework, we estabilish several limit theorems for the walker's distance, which include the Strong Law of Large Numbers (SLLN), the Law of the Iterated Logarithm (LIL), and the Invariance Principle, under an i.i.d. hypothesis for the walker's leaf-adding mechanism. Further, we show that the limit speed defined by the SLLN is a continuous function over the space of probability distributions on ℕ.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections