Convergence of uniform noncrossing partitions toward the Brownian triangulation

zbMATH Open1415.52011arXiv1711.04872MaRDI QIDQ2632677FDOQ2632677

Authors: Jérémie Bettinelli 

Publication date: 15 May 2019

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Abstract: We give a short proof that a uniform noncrossing partition of the regular $n$-gon weakly converges toward Aldous's Brownian triangulation of the disk, in the sense of the Hausdorff topology. This result was first obtained by Curien & Kortchemski, using a more complicated encoding. Thanks to a result of Marchal on strong convergence of Dyck paths toward the Brownian excursion, we furthermore give an algorithm that allows to recursively construct a sequence of uniform noncrossing partitions for which the previous convergence holds almost surely. In addition, we also treat the case of uniform noncrossing pair partitions of even-sided polygons.

Full work available at URL: https://arxiv.org/abs/1711.04872

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Random non-crossing plane configurations: a conditioned Galton-Watson tree approach
• Scaling limit of triangulations of polygons
• Random recursive triangulations of the disk via fragmentation theory
• Dissecting the circle, at random
• On the number of large triangles in the Brownian triangulation and fragmentation processes

zbMATH Keywords

Dyck pathnoncrossing partitionBrownian excursionlaminationBrownian triangulationnoncrossing pair partition

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Cites Work

• Title not available (Why is that?)
• Noncrossing Partitions in Surprising Locations
• Triangulating stable laminations
• Title not available (Why is that?)
• Scaling limits of bipartite planar maps are homeomorphic to the 2-sphere
• An invariance principle for random walk conditioned by a late return to zero
• Recursive self-similarity for random trees, random triangulations and Brownian excursion
• Triangulating the Circle, at Random
• More bijective Catalan combinatorics on permutations and on signed permutations
• Random stable laminations of the disk
• Random non-crossing plane configurations: a conditioned Galton-Watson tree approach
• Random recursive triangulations of the disk via fragmentation theory
• Title not available (Why is that?)
• Simply generated non-crossing partitions

Cited In (5)

• A geometric representation of fragmentation processes on stable trees
• Random stable-type minimal factorizations of the \(n\)-cycle
• Convergence to equilibrium of biased plane Partitions
• The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
• On the number of large triangles in the Brownian triangulation and fragmentation processes

This page was built for publication: Convergence of uniform noncrossing partitions toward the Brownian triangulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2632677)