Abstract
We study various models of random non-crossing configurations consisting of diagonals of convex polygons, and focus in particular on uniform dissections and non-crossing trees. For both these models, we prove convergence in distribution towards Aldous' Brownian triangulation of the disk. In the case of dissections, we also refine the study of the maximal vertex degree and validate a conjecture of Bernasconi, Panagiotou and Steger. Our main tool is the use of an underlying Galton-Watson tree structure.
| Original language | English |
|---|---|
| Pages (from-to) | 236-260 |
| Number of pages | 25 |
| Journal | Random Structures and Algorithms |
| Volume | 45 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Jan 2014 |
| Externally published | Yes |
Keywords
- Brownian triangulation
- Conditioned Galton-Watson trees
- Dissections
- Non-crossing plane configurations
- Probability on graphs