The dual tree of a recursive triangulation of the disk (Q2338914)

In the recursive lamination of the disk, one tries to add chords one after another at random; a chord is kept and inserted if it does not intersect any of the previously inserted ones. \textit{N. Curien} and \textit{J.-F. Le Gall} [Ann. Probab. 39, No. 6, 2224--2270 (2011; Zbl 1252.60016)] have proved that the set of chords converges to a limit triangulation of the disk encoded by a continuous process \(\mathcal{M}\). Based on a new approach resembling ideas from the so-called contraction method in function spaces, this paper proves that, when properly rescaled, the planar dual of the discrete lamination converges almost surely in the Gromov-Hausdorff sense to a limit real tree \(\mathcal{T}\), which is encoded by \(\mathcal{M}\). This confirms a conjecture of Curien and Le Gall [loc. cit.].