Scaling limits of tree-valued branching random walks
Thomas Duquesne, Robin Khanfir, Shen Lin, Niccolo Torri

TL;DR
This paper studies the scaling limits of a tree-valued branching random walk on a b-ary tree, showing convergence to a reflected Brownian cactus with a stable branching mechanism, and establishing a law of large numbers for its range.
Contribution
It introduces a new scaling limit for a branching random walk on trees with stable offspring distribution, connecting it to the reflected Brownian cactus structure.
Findings
Law of large numbers for the range size of the BRW
Convergence of the rescaled range to a reflected Brownian cactus
Identification of the scaling sequence for the metric space
Abstract
We consider a branching random walk (BRW) taking its values in the -ary rooted tree (i.e. the set of finite words written in the alphabet , with ). The BRW is indexed by a critical Galton--Watson tree conditioned to have vertices; its offspring distribution is aperiodic and is in the domain of attraction of a -stable law, . The jumps of the BRW are those of a nearest-neighbour null-recurrent random walk on (reflection at the root of and otherwise: probability to move closer to the root of and probability to move away from it to one of the sites above). We denote by the range of the BRW in which is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Theoretical and Computational Physics · Random Matrices and Applications
