Scaling limit of the range of tree-valued branching random walks in random environmen

Abstract

We study a branching random walk (BRW) taking its values in a random tree (seen as a family tree) with an infinite line of ancestors that is a variant of a supercritical Galton--Watson (GW) tree with offspring distribution . The transition probabilities of the BRW are those of a critical biased random walk on : namely, the probability to move from x to one of its kx children is 1/(m+kx) and the probability to move from x to the direct parent of x is m/(m+kx). Here stands for the mean of . The BRW is indexed by a critical GW tree conditioned to have n vertices and whose offspring distribution is in the domain of attraction of an α-stable law with α ∈o (1, 2]. We denote by n the range of the BRW, i.e., ~the set of all sites in visited by the BRW. Under a moment assumption for , we prove that if we view n as a random subtree of equipped with its graph distance dgr and with its occupation measure (n)occ then there exists a scaling sequence sn \! \! ∞ such that conditionally given the environment , the measured metric space (n, sn-1dgr , 1n(n)occ ) weakly converges in the Gromov--Hausdorff--Prokhorov sense to a random measured compact real tree introduced by Curien, Le Gall \& Miermont in CuLGMi13 called the Brownian cactus with α-stable branching mechanism. This work extends in random environment the result from D., K., Lin \& Torri DuKhLiTo22 which deals with the case where is a regular tree.

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…