Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2604.14138 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917410950348800 |
|---|---|
| author | Caraceni, Alessandra Curien, Nicolas Fleurat, William Twigt, Adrianus |
| author_facet | Caraceni, Alessandra Curien, Nicolas Fleurat, William Twigt, Adrianus |
| contents | 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 transition specializes to the Luczak-Winkler & Caraceni-Stauffer coupling, its scaling limit provides a suprising càdlàg erasure of Brownian trees, reminiscent of SLE theory. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_14138 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Sweet Trims are made of Threes: A càdlàg erasure of the Brownian tree Caraceni, Alessandra Curien, Nicolas Fleurat, William Twigt, Adrianus Probability Combinatorics 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 transition specializes to the Luczak-Winkler & Caraceni-Stauffer coupling, its scaling limit provides a suprising càdlàg erasure of Brownian trees, reminiscent of SLE theory. |
| title | Sweet Trims are made of Threes: A càdlàg erasure of the Brownian tree |
| topic | Probability Combinatorics |
| url | https://arxiv.org/abs/2604.14138 |