The dual tree of a recursive triangulation of the disk - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Annals of Probability Year : 2015

The dual tree of a recursive triangulation of the disk

Abstract

In the recursive lamination of the disk, one tries to add chords one after an other at random; a chord is kept and inserted if it does not intersect any of the previously inserted ones. Curien and Le Gall [Ann. Probab., vol. 39, pp. 2224--2270, 2011] have proved that the set of chords converges to a limit triangulation of the disk encoded by a continuous process $\mathscr M$ . Based on a new approach resembling ideas from the so-called contraction method in function spaces, we prove that, when properly rescaled, the planar dual of the discrete lamination converges almost surely in the Gromov--Hausdorff sense to a limit real tree $\mathscr T$, which is encoded by $\mathscr M$. This is one of the first natural limit real trees which is identified and does not come from the excursion of a L{é}vy process.

Dates and versions

hal-00773362 , version 1 (13-01-2013)

Identifiers

Cite

Nicolas Broutin, Henning Sulzbach. The dual tree of a recursive triangulation of the disk. Annals of Probability, 2015, 43, pp.738-781. ⟨10.1214/13-AOP894⟩. ⟨hal-00773362⟩
136 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More