The cut-tree of large recursive trees (Q2346180)

The cut-tree records the key steps of the destruction process, where a graph is progressively destroyed by cutting its edges one after the other in a uniform order. It can be viewed as a random metric space equipped with a natural probability mass. In this paper, the author shows that the cut-tree of a random recursive tree of size \(n\), rescaled by the factor \(n^{-1}\ln n\), converges in probability to the unit interval endowed with the usual distance and Lebesgue measure as \(n \rightarrow \infty\), in the sense of Gromov-Hausdorff-Prokhorov. Some results of \textit{M. F. Kuba} and \textit{A. Panholzer} [Online J. Anal. Comb. 9, Article 7, 26 p. (2014; Zbl 1300.05285)] on multiple isolation of nodes in large random recursive trees are extended in this paper.