Cutting edges at random in large recursive trees - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2014

Cutting edges at random in large recursive trees

Erich Baur
  • Fonction : Auteur
  • PersonId : 955578
Jean Bertoin
  • Fonction : Auteur
  • PersonId : 917100

Résumé

We comment on old and new results related to the destruction of a random recursive tree (RRT), in which its edges are cut one after the other in a uniform random order. In particular, we study the number of steps needed to isolate or disconnect certain distinguished vertices when the size of the tree tends to infinity. New probabilistic explanations are given in terms of the so-called cut-tree and the tree of component sizes, which both encode different aspects of the destruction process. Finally, we establish the connection to Bernoulli bond percolation on large RRT's and present recent results on the cluster sizes in the supercritical regime.
Fichier principal
Vignette du fichier
cutting-edges.pdf (482.41 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00982497 , version 1 (24-04-2014)
hal-00982497 , version 2 (10-06-2014)

Identifiants

  • HAL Id : hal-00982497 , version 2

Citer

Erich Baur, Jean Bertoin. Cutting edges at random in large recursive trees. 2014. ⟨hal-00982497v2⟩
170 Consultations
427 Téléchargements

Partager

Gmail Facebook X LinkedIn More