z-logo
open-access-imgOpen Access
Reversing the cut tree of the Brownian continuum random tree
Author(s) -
Nicolas Broutin,
Minmin Wang
Publication year - 2017
Publication title -
electronic journal of probability
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.666
H-Index - 53
ISSN - 1083-6489
DOI - 10.1214/17-ejp105
Subject(s) - random tree , mathematics , brownian motion , combinatorics , tree (set theory) , fragmentation (computing) , discrete mathematics , statistics , computer science , motion planning , artificial intelligence , robot , operating system
Consider the Aldous--Pitman fragmentation process [Ann Probab, 26(4):1703--1726, 1998] of a Brownian continuum random tree ${\cal T}^{\mathrm{br}}$. The associated cut tree cut$({\cal T}^{\mathrm{br}})$, introduced by Bertoin and Miermont [Ann Appl Probab, 23:1469--1493, 2013], is defined in a measurable way from the fragmentation process, describing the genealogy of the fragmentation, and is itself distributed as a Brownian CRT. In this work, we introduce a shuffle transform, which can be considered as the reverse of the map taking ${\cal T}^{\mathrm{br}}$ to cut$({\cal T}^{\mathrm{br}})$.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom