The cut-tree of large recursive trees - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2013

The cut-tree of large recursive trees

Jean Bertoin
  • Fonction : Auteur
  • PersonId : 917100

Résumé

Imagine a graph which is progressively destroyed by cutting its edges one after the other in a uniform random order. The so-called cut-tree records key steps of this destruction process. It can be viewed as a random metric space equipped with a natural probability mass. In this work, we show that the cut-tree of a random recursive tree of size $n$, rescaled by the factor $n^{-1}\ln n$, converges in probability as $n\to \infty$ in the sense of Gromov-Hausdorff-Prokhorov, to the unit interval endowed with the usual distance and Lebesgue measure. This enables us to explain and extend some recent results of Kuba and Panholzer on multiple isolation of nodes in random recursive trees.
Fichier principal
Vignette du fichier
Cuttree_RRT.pdf (151.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00859385 , version 1 (07-09-2013)

Identifiants

  • HAL Id : hal-00859385 , version 1

Citer

Jean Bertoin. The cut-tree of large recursive trees. 2013. ⟨hal-00859385⟩
113 Consultations
233 Téléchargements

Partager

Gmail Facebook X LinkedIn More