Simply generated non-crossing partitions
From MaRDI portal
Abstract: We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing partitions with constraints on their block sizes. Our main tool is a bijection between non-crossing partitions and plane trees, which maps such simply generated non-crossing partitions into simply generated trees so that blocks of size are in correspondence with vertices of outdegree . This allows us to obtain limit theorems concerning the block structure of simply generated non-crossing partitions. We apply our results in free probability by giving a simple formula relating the maximum of the support of a compactly supported probability measure on the real line in term of its free cumulants.
Recommendations
Cites work
- A correspondence between ordered trees and noncrossing partitions
- A limit theorem for the contour process of conditioned Galton-Watson trees
- Analytic combinatorics
- Chain enumeration and non-crossing partitions
- Extremal statistics on non-crossing configurations
- Functionals of the Brownian Bridge
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 527331 (Why is no real title available?)
- scientific article; zbMATH DE number 1465044 (Why is no real title available?)
- scientific article; zbMATH DE number 918811 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- Large deviations for non-crossing partitions
- Large deviations of Markov chains indexed by random trees
- Multiplicative functions on the lattice of non-crossing partitions and free convolution
- Noncrossing Partitions in Surprising Locations
- Noncrossing trees are almost conditioned Galton–Watson trees
- Normalized excursion, meander and bridge for stable Lévy processes
- On properties of random dissections and triangulations
- On the Altitude of Nodes in Random Trees
- On the number of large triangles in the Brownian triangulation and fragmentation processes
- Ordered trees and non-crossing partitions
- Products of free random variables and k-divisible non-crossing partitions
- Properties of random triangulations and trees
- Random non-crossing plane configurations: a conditioned Galton-Watson tree approach
- Random stable laminations of the disk
- Random trees with superexponential branching weights
- Recurrence of bipartite planar maps
- Rescaled bipartite planar maps converge to the Brownian map
- Scaling limits of bipartite planar maps are homeomorphic to the 2-sphere
- Scaling limits of random planar maps with a unique large face
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Some set partition statistics in non-crossing partitions and generating functions
- Statistics of blocks in k-divisible non-crossing partitions
- Statistics on non-crossing trees
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- Taylor expansions of R-transforms, application to supports and moments
- The distribution of the maximum vertex degree in random planar maps
- Triangulating the Circle, at Random
Cited in
(9)- A geometric representation of fragmentation processes on stable trees
- Random generation and scaling limits of fixed genus factorizations into transpositions
- The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
- Convergence of uniform noncrossing partitions toward the Brownian triangulation
- Cycles in random meander systems
- Large deviations for non-crossing partitions
- On scaling limits of multitype Galton-Watson trees with possibly infinite variance
- Random stable-type minimal factorizations of the \(n\)-cycle
- scientific article; zbMATH DE number 7662504 (Why is no real title available?)
This page was built for publication: Simply generated non-crossing partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366962)
