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

2005/09/22 by Thomas Duquesne, Duquesne, Thomas
Mathematics · #FOS: Mathematics #G22 #G3 #Probability (math.PR) #math.PR #msc:G22 #msc:G3

paper · pdf · doi:10.48550/arxiv.math/0509524

42 pages; 1 figure; 2004

arxiv created 2005/09/22 · arxiv updated 2009/12/01

Abstract

Let b be an integer greater than 1 and let W^\ee=(W^\ee_n; n≥ 0) be a random walk on the b-ary rooted tree \U_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 a_i. Here å=(a₁, ..., a_b) stands for some non-degenerated fixed set of weights. We consider the range \W^\ee_n ; n≥ 0 \ that is a subtree of \U_b . It corresponds to a unique random rooted ordered tree that we denote by τ_ε. We rescale the edges of τ_ε by a factor \ee and we let \ee 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 å=(a_n, n≥ 0).

Related

• Invariance principles for random walks in random environment on trees
• The continuum random tree is the scaling limit of unlabelled unrooted trees
• Scaling limits of tree-valued branching random walks
• Stable limit laws for randomly biased walks on supercritical trees
• Linearly Edge-Reinforced Random Walks