• Corpus ID: 238259531

Tree Builder Random Walk beyond uniform ellipticity

  title={Tree Builder Random Walk beyond uniform ellipticity},
  author={J'anos Englander and Giulio Iacobelli and Rodrigo Ribeiro},
We investigate a self-interacting random walk, whose dynamically evolving environment is a random tree built by the walker itself, as it walks around. At time n = 1, 2, . . . , right before stepping, the walker adds a random number (possibly zero) Zn of leaves to its current position. We assume that the Zn’s are independent, but, importantly, we do not assume that they are identically distributed. We obtain non-trivial conditions on their distributions under which the random walk is recurrent… 




We prove that a law of large numbers and a central limit theorem hold for the excited random walk model in every dimension d ≥ 2.

On a random walk that grows its own tree

This paper studies 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.

Tree builder random walk: Recurrence, transience and ballisticity

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

Concentration Inequalities for Sums and Martingales

Classical Results.- Concentration Inequalities for Sums.- Concentration Inequalities for Martingales.- Applications in Probability and Statistics.

Hitting Times of Walks on Graphs through Voltages

We derive formulas for the expected hitting times of general random walks on graphs, in terms of voltages, with very elementary electric means. Under this new light we revise bounds and hitting times

On a Class Of Transient Random Walks in Random Environment

We introduce in this article a class of transient random walks in a random environment on Z d . When d ≥ 2, these walks are ballistic and we derive a law of large numbers, a central limit theorem and

Phase transition in vertex-reinforced random walks on Z with non-linear reinforcement

It is shown that if w k ∼ k α , then there is a large time T 0 such that after T 0 the walk visits 2, 5, or ∞ sites when α < 1, = 1, or > 1, respectively.

Random walks on dynamic configuration models:A trichotomy

Extremal cover times for random walks on trees

The exact lower bound on the cover time of the tree T is obtained by showing that Cν(T) is minimized when T is a star and v is one of its leaves, and the time to cover all vertices and then return to the starting point is minimized by aStar and maximized by a path.