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…