Rémy's diffusion on Brownian trees

Abstract

Rémy's algorithm is a famous recursive construction of uniform random binary trees of growing size by a local grafting operation. In this work we construct a continuous version, a new local diffusion on the space of real trees of growing Brownian Continuum Random Trees (CRT's). It appears as the scaling limit of a variant of Rémy's algorithm due to Bacher, Bodini, and Jacquot. Once the trees are rescaled to have constant mass, this diffusion uncovers an ergodic dynamics on trees with the Brownian CRT as unique invariant law.

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…