Convergence of uniform noncrossing partitions toward the Brownian triangulation

zbMath1415.52011arXiv1711.04872MaRDI QIDQ2632677

Jérémie L. Bettinelli

Publication date: 15 May 2019

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

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

File on IPFS

zbMATH Keywords

Brownian excursionDyck pathlaminationnoncrossing partitionBrownian triangulationnoncrossing pair partition

Mathematics Subject Classification ID

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

Related Items (3)

Random stable-type minimal factorizations of the n-cycle ⋮ A geometric representation of fragmentation processes on stable trees ⋮ The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangulating stable laminations
• Random recursive triangulations of the disk via fragmentation theory
• 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
• Random stable laminations of the disk
• More bijective Catalan combinatorics on permutations and on signed permutations
• Random non-crossing plane configurations: A conditioned Galton-Watson tree approach
• Noncrossing Partitions in Surprising Locations
• Triangulating the Circle, at Random
• Simply Generated Non-Crossing Partitions

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