## Electronic Journal of Probability

### Reversing the cut tree of the Brownian continuum random tree

#### Abstract

Consider the Aldous–Pitman fragmentation process [7] of a Brownian continuum random tree $\mathcal{T} ^{\mathrm{br} }$. The associated cut tree $\operatorname{cut} (\mathcal{T} ^{\mathrm{br} })$, introduced by Bertoin and Miermont [13], 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 $\mathcal{T} ^{\mathrm{br} }$ to $\operatorname{cut} (\mathcal{T} ^{\mathrm{br} })$.

#### Article information

Source
Electron. J. Probab., Volume 22 (2017), paper no. 80, 23 pp.

Dates
Accepted: 8 September 2017
First available in Project Euclid: 6 October 2017

https://projecteuclid.org/euclid.ejp/1507255394

Digital Object Identifier
doi:10.1214/17-EJP105

Mathematical Reviews number (MathSciNet)
MR3710800

Zentralblatt MATH identifier
1379.60095

#### Citation

Broutin, Nicolas; Wang, Minmin. Reversing the cut tree of the Brownian continuum random tree. Electron. J. Probab. 22 (2017), paper no. 80, 23 pp. doi:10.1214/17-EJP105. https://projecteuclid.org/euclid.ejp/1507255394

#### References

• [1] Romain Abraham and Jean-François Delmas, The forest associated with the record process on a Lévy tree, Stochastic Process. Appl. 123 (2013), no. 9, 3497–3517.
• [2] Romain Abraham and Jean-François Delmas, Record process on the continuum random tree, ALEA Lat. Am. J. Probab. Math. Stat. 10 (2013), no. 1, 225–251.
• [3] Romain Abraham and Laurent Serlet, Poisson snake and fragmentation, Electron. J. Probab. 7 (2002), no. 17, 15.
• [4] Louigi Addario-Berry, Nicolas Broutin, and Cecilia Holmgren, Cutting down trees with a Markov chainsaw, Ann. Appl. Probab. 24 (2014), no. 6, 2297–2339.
• [5] Louigi Addario-Berry, Daphné Dieuleveut, and Christina Goldschmidt, Inverting the cut-tree transform, arXiv:1606.04825, 2016.
• [6] David Aldous, The continuum random tree. III, Ann. Probab. 21 (1993), no. 1, 248–289.
• [7] David Aldous and Jim Pitman, The standard additive coalescent, Ann. Probab. 26 (1998), no. 4, 1703–1726.
• [8] Erich Baur and Jean Bertoin, Cutting edges at random in large recursive trees, Stochastic analysis and applications 2014, Springer Proc. Math. Stat., vol. 100, Springer, Cham, 2014, pp. 51–76.
• [9] Jean Bertoin, Random fragmentation and coagulation processes, Cambridge Studies in Advanced Mathematics, vol. 102, Cambridge University Press, Cambridge, 2006.
• [10] Jean Bertoin, Fires on trees, Ann. Inst. Henri Poincaré Probab. Stat. 48 (2012), no. 4, 909–921.
• [11] Jean Bertoin, The cut-tree of large recursive trees, Ann. Inst. Henri Poincaré Probab. Stat. 51 (2015), no. 2, 478–488.
• [12] Jean Bertoin and Alexander V. Gnedin, Asymptotic laws for nonconservative self-similar fragmentations, Electron. J. Probab. 9 (2004), no. 19, 575–593.
• [13] Jean Bertoin and Grégory Miermont, The cut-tree of large Galton-Watson trees and the Brownian CRT, Ann. Appl. Probab. 23 (2013), no. 4, 1469–1493.
• [14] Stéphane Boucheron, Gábor Lugosi, and Pascal Massart, Concentration inequalities, Oxford University Press, Oxford, 2013, A nonasymptotic theory of independence, With a foreword by Michel Ledoux.
• [15] Nicolas Broutin and Minmin Wang, Cutting down $\bf p$-trees and inhomogeneous continuum random trees, Bernoulli 23 (2017), no. 4A, 2380–2433.
• [16] Daphné Dieuleveut, The vertex-cut-tree of Galton-Watson trees converging to a stable tree, Ann. Appl. Probab. 25 (2015), no. 4, 2215–2262.
• [17] Michael Drmota, Alex Iksanov, Martin Moehle, and Uwe Roesler, A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree, Random Structures Algorithms 34 (2009), no. 3, 319–336.
• [18] Thomas Duquesne and Jean-François Le Gall, Probabilistic and fractal aspects of Lévy trees, Probab. Theory Related Fields 131 (2005), no. 4, 553–603.
• [19] Steven N. Evans, Probability and real trees, Lecture Notes in Mathematics, vol. 1920, Springer, Berlin, 2008, Lectures from the 35th Summer School on Probability Theory held in Saint-Flour, July 6–23, 2005.
• [20] James Allen Fill, Nevin Kapur, and Alois Panholzer, Destruction of very simple trees, Algorithmica 46 (2006), no. 3-4, 345–366.
• [21] Misha Gromov, Metric structures for Riemannian and non-Riemannian spaces, english ed., Modern Birkhäuser Classics, Birkhäuser Boston, Inc., Boston, MA, 2007, Based on the 1981 French original, With appendices by M. Katz, P. Pansu and S. Semmes, Translated from the French by Sean Michael Bates.
• [22] Cecilia Holmgren, Random records and cuttings in binary search trees, Combin. Probab. Comput. 19 (2010), no. 3, 391–424.
• [23] Cecilia Holmgren, A weakly 1-stable distribution for the number of random records and cuttings in split trees, Adv. in Appl. Probab. 43 (2011), no. 1, 151–177.
• [24] Alex Iksanov and Martin Möhle, A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree, Electron. Comm. Probab. 12 (2007), 28–35.
• [25] Svante Janson, Random cutting and records in deterministic and random trees, Random Structures Algorithms 29 (2006), no. 2, 139–179.
• [26] Jean-François Le Gall, The uniform random tree in a Brownian excursion, Probab. Theory Related Fields 96 (1993), no. 3, 369–383.
• [27] Jean-François Le Gall, Random trees and applications, Probab. Surv. 2 (2005), 245–311.
• [28] A. Meir and J. W. Moon, Cutting down random trees, J. Austral. Math. Soc. 11 (1970), 313–324.
• [29] Grégory Miermont, Tessellations of random maps of arbitrary genus, Ann. Sci. Éc. Norm. Supér. (4) 42 (2009), no. 5, 725–781.
• [30] Alois Panholzer, Cutting down very simple trees, Quaest. Math. 29 (2006), no. 2, 211–227.