Random non-crossing plane configurations: A conditioned Galton-Watson tree approach

DOI10.1002/rsa.20481zbMath1301.05310arXiv1201.3354OpenAlexW3102259369MaRDI QIDQ2925524

Igor Kortchemski, Nicolas Curien

Publication date: 16 October 2014

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

dissectionsconditioned Galton-Watson treesBrownian triangulationnon-crossing plane configurationsprobability on graphs

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) General convexity (52A99)

Related Items

Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees ⋮ Dissecting the circle, at random ⋮ Convergence of uniform noncrossing partitions toward the Brownian triangulation ⋮ Random stable-type minimal factorizations of the n-cycle ⋮ The CRT is the scaling limit of random dissections ⋮ Schröder’s problems and scaling limits of random trees ⋮ Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Limits of random tree-like discrete structures ⋮ Parking on Cayley trees and frozen Erdős-Rényi ⋮ On the maximal offspring in a subcritical branching process ⋮ Simply Generated Non-Crossing Partitions ⋮ Invariance principles for Galton-Watson trees conditioned on the number of leaves ⋮ Random stable laminations of the disk ⋮ On the number of large triangles in the Brownian triangulation and fragmentation processes ⋮ A geometric representation of fragmentation processes on stable trees ⋮ Spaces of algebraic measure trees and triangulations of the circle ⋮ The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees ⋮ Counter examples to invariant circle packing ⋮ The dual tree of a recursive triangulation of the disk ⋮ Random generation and scaling limits of fixed genus factorizations into transpositions ⋮ Limit theorems for conditioned non-generic Galton-Watson trees

Cites Work

• Invariance principles for Galton-Watson trees conditioned on the number of leaves
• Random recursive triangulations of the disk via fragmentation theory
• On properties of random dissections and triangulations
• Limit of normalized quadrangulations: the Brownian map
• Random trees and applications
• Scaling limits of bipartite planar maps are homeomorphic to the 2-sphere
• Subdiffusive behavior of random walk on a random cluster
• Properties of random triangulations and trees
• Analytic combinatorics of non-crossing configurations
• Recursive self-similarity for random trees, random triangulations and Brownian excursion
• A limit theorem for the contour process of conditioned Galton-Watson trees
• The distribution of the maximum vertex degree in random planar maps
• Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set
• Random stable laminations of the disk
• Probability on Trees and Networks
• Schröder’s problems and scaling limits of random trees
• Triangulating the Circle, at Random
• Noncrossing trees are almost conditioned Galton–Watson trees

This page was built for publication: Random non-crossing plane configurations: A conditioned Galton-Watson tree approach