Random stable-type minimal factorizations of the n-cycle

DOI10.1017/APR.2021.21zbMath1500.60004arXiv2002.12027OpenAlexW4213418259WikidataQ114119648 ScholiaQ114119648MaRDI QIDQ5066873

Paul Thévenin

Publication date: 31 March 2022

Published in: Advances in Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

permutationsstable processesrandom treesscaling limitslaminations of the disk

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05) Functional limit theorems; invariance principles (60F17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
• Invariance principles for Galton-Watson trees conditioned on the number of leaves
• Scaling limits of random planar maps with large faces
• Invariance principles for spatial multitype Galton-Watson trees
• Vertices with fixed outdegrees in large Galton-Watson trees
• Scaling limits of bipartite planar maps are homeomorphic to the 2-sphere
• An elementary proof of Hawkes's conjecture on Galton-Watson trees.
• Arbres et processus de Galton-Watson. (Trees and Galton-Watson processes)
• Subdiffusive behavior of random walk on a random cluster
• A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
• The standard additive coalescent
• A limit theorem for the contour process of conditioned Galton-Watson trees
• The depth first processes of Galton-Watson trees converge to the same Brownian excursion
• Tree-like properties of cycle factorizations
• The local limit of random sorting networks
• Planar maps as labeled mobiles
• A geometric representation of fragmentation processes on stable trees
• \(k\)-indivisible noncrossing partitions
• The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
• Factorizations of cycles and multi-noded rooted trees
• Random walk on random infinite looptrees
• Labelled trees and factorizations of a cycle into transpositions
• Random sorting networks
• Limit theorems for sampling from finite populations
• Random stable laminations of the disk
• Minimal factorizations of a cycle and central multiplicative functions on the infinite symmetric group
• Convergence of uniform noncrossing partitions toward the Brownian triangulation
• Random non-crossing plane configurations: A conditioned Galton-Watson tree approach
• The Galton-Watson process conditioned on the total progeny
• On the Altitude of Nodes in Random Trees
• Triangulating the Circle, at Random
• On scaling limits of multitype Galton-Watson trees with possibly infinite variance
• Minimal factorizations of a cycle: a multivariate generating function
• Simply Generated Non-Crossing Partitions
• Trajectories in random minimal transposition factorizations

This page was built for publication: Random stable-type minimal factorizations of the n-cycle