2 papers
math.PR2026
Sweet Trims are made of Threes: A cà dlà g erasure of the Brownian tree
Alessandra Caraceni, Nicolas Curien, William Fleurat +1
We present a simple trimming algorithm that generates nested uniform binary plane trees by removing leaves one-by-one using a best-of-three-match procedure. While its one-step tran…
math.PR2025
Growing Self-Similar Markov Trees
Nicolas Curien, William Fleurat, Adrianus Twigt
Can we obtain a Brownian CRT of mass from a CRT of mass by cutting certain branches? In this paper, we will answer that question in the much more general setting of self-…