Skip to Main content Skip to Navigation

Conditionnement de grands arbres aléatoires et configurations planes non-croisées

Abstract : Scaling limits of large random trees play an important role in this thesis. We are more precisely interested in the asymptotic behavior of several functions coding conditioned Galton-Watson trees. We consider several types of conditioning, involving different quantities such as the total number of vertices or leaves, as well as several types of offspring distributions. When the offspring distribution is critical and belongs to the domainof attraction of a stable law, a universality phenomenon occurs: these trees look like the samecontinuous random tree, the so-called stable Lévy tree. However, when the offspring distributionis not critical, the theoretical physics community has noticed that condensation phenomenamay occur, meaning that with high probability there exists a unique vertex with macroscopicdegree comparable to the total size of the tree. The goal of one of our contributions is to graspa better understanding of this phenomenon. Last but not least, we study random non-crossingconfigurations consisting of diagonals of regular polygons, and notice that they are intimatelyrelated to Galton-Watson trees conditioned on having a fixed number of leaves. In particular,this link sheds new light on uniform dissections and allows us to obtain some interesting resultsof a combinatorial flavor.
Document type :
Complete list of metadata
Contributor : Abes Star :  Contact
Submitted on : Friday, April 26, 2013 - 11:33:09 AM
Last modification on : Monday, November 9, 2020 - 3:40:04 PM
Long-term archiving on: : Monday, April 3, 2017 - 11:52:16 PM


Version validated by the jury (STAR)


  • HAL Id : tel-00818190, version 1



Igor Kortchemski. Conditionnement de grands arbres aléatoires et configurations planes non-croisées. Mathématiques générales [math.GM]. Université Paris Sud - Paris XI, 2012. Français. ⟨NNT : 2012PA112362⟩. ⟨tel-00818190⟩



Record views


Files downloads