Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
96 tokens/sec
Gemini 2.5 Pro Premium
44 tokens/sec
GPT-5 Medium
18 tokens/sec
GPT-5 High Premium
18 tokens/sec
GPT-4o
105 tokens/sec
DeepSeek R1 via Azure Premium
83 tokens/sec
GPT OSS 120B via Groq Premium
475 tokens/sec
Kimi K2 via Groq Premium
259 tokens/sec
2000 character limit reached

Reversing the cut tree of the Brownian continuum random tree (1408.2924v3)

Published 13 Aug 2014 in math.PR

Abstract: 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}})$.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.