Random non‐crossing plane configurations: A conditioned Galton‐Watson tree approach. Issue 2 (29th December 2012)

• Record Type: Journal Article
• Authors: Curien, Nicolas; Kortchemski, Igor
• Is Part Of: Random structures & algorithms. Volume 45:Issue 2(2014)
• Page Start: 236
• Page End: 260
• Publication Date: 2012-12-29
• Subjects: Random graphs -- Periodicals; Mathematical analysis -- Periodicals; 519
• DOI: 10.1002/rsa.20481
• Languages: English
• ISSNs: 1042-9832

Abstract

<abstract abstract-type="main"> <title>ABSTRACT</title> <p>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. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 45, 236–260, 2014</p> </abstract>