Simply Generated Non-Crossing Partitions
From MaRDI portal
Publication:5366962
DOI10.1017/S0963548317000050zbMath1371.05230arXiv1503.09174OpenAlexW3102562739MaRDI QIDQ5366962
Igor Kortchemski, Cyril Marzouk
Publication date: 10 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.09174
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items
Convergence of uniform noncrossing partitions toward the Brownian triangulation ⋮ Random stable-type minimal factorizations of the n-cycle ⋮ Cycles in random meander systems ⋮ Unnamed Item ⋮ On scaling limits of multitype Galton-Watson trees with possibly infinite variance ⋮ A geometric representation of fragmentation processes on stable trees ⋮ The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees ⋮ Random generation and scaling limits of fixed genus factorizations into transpositions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rescaled bipartite planar maps converge to the Brownian map
- Large deviations for non-crossing partitions
- Products of free random variables and \(k\)-divisible non-crossing partitions
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Statistics of blocks in \(k\)-divisible non-crossing partitions
- On the number of large triangles in the Brownian triangulation and fragmentation processes
- Scaling limits of random planar maps with large faces
- On properties of random dissections and triangulations
- Scaling limits of bipartite planar maps are homeomorphic to the 2-sphere
- A correspondence between ordered trees and noncrossing partitions
- Ordered trees and non-crossing partitions
- Chain enumeration and non-crossing partitions
- Properties of random triangulations and trees
- Multiplicative functions on the lattice of non-crossing partitions and free convolution
- Normalized excursion, meander and bridge for stable Lévy processes
- A limit theorem for the contour process of conditioned Galton-Watson trees
- Statistics on non-crossing trees
- The distribution of the maximum vertex degree in random planar maps
- Scaling limits of random planar maps with a unique large face
- Random stable laminations of the disk
- Recurrence of bipartite planar maps
- Extremal statistics on non-crossing configurations
- Some set partition statistics in non-crossing partitions and generating functions
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- Large deviations of Markov chains indexed by random trees
- Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
- Functionals of the Brownian Bridge
- Random non-crossing plane configurations: A conditioned Galton-Watson tree approach
- Random trees with superexponential branching weights
- Noncrossing Partitions in Surprising Locations
- On the Altitude of Nodes in Random Trees
- Triangulating the Circle, at Random
- Noncrossing trees are almost conditioned Galton–Watson trees
- Taylor expansions of $R$-transforms, application to supports and moments
