Continuum tree limit for the range of random walks on regular trees

Abstract

Let b be an integer greater than 1 and let W=(Wn; n≥ 0) be a random walk on the b-ary rooted tree b, starting at the root, going up (resp. down) with probability 1/2+ε (resp. 1/2 -ε), ε ∈ (0, 1/2), and choosing direction i∈ \1, ..., b\ when going up with probability ai. Here =(a1, ..., ab) stands for some non-degenerated fixed set of weights. We consider the range \Wn ; n≥ 0 \ that is a subtree of b . It corresponds to a unique random rooted ordered tree that we denote by τε. We rescale the edges of τε by a factor and we let go to 0: we prove that correlations due to frequent backtracking of the random walk only give rise to a deterministic phenomenon taken into account by a positive factor γ (). More precisely, we prove that τε converges to a continuum random tree encoded by two independent Brownian motions with drift conditioned to stay positive and scaled in time by γ (). We actually state the result in the more general case of a random walk on a tree with an infinite number of branches at each node (b=∞) and for a general set of weights =(an, n≥ 0).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…