Random stable-type minimal factorizations of the n-cycle

DOI10.1017/APR.2021.21MaRDI QIDQ5066873zbMATH OpenOpenAlexWikidataFDO

Authors 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

permutationsscaling limitsstable processesrandom treeslaminations of the disk

Mathematics Subject Classification ID

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

Abstract: We investigate random minimal factorizations of the $n$-cycle, that is, factorizations of the permutation $(1,2cdotsn)$ into a product of cycles $a{u}_1,ldots,a{u}_k$ whose lengths $ell(a{u}_1),ldots,ell(a{u}_k)$ verify the minimality condition $su{m}_{i=1}^k(ell(a{u}_i)-1)=n-1$. By associating to a cycle of the factorization a black polygon inscribed in the unit disk, and reading the cycles one after an other, we code a minimal factorization by a process of colored laminations of the disk, which are compact subsets made of red noncrossing chords delimiting faces that are either black or white. Our main result is the convergence of this process as $nightarrowinfty$, when the factorization is randomly chosen according to Boltzmann weights in the domain of attraction of an $alpha$-stable law, for some $alphain(1,2]$. The new limiting process interpolates between the unit circle and a colored version of Kortchemski's $alpha$-stable lamination. Our principal tool in the study of this process is a bijection between minimal factorizations and a model of size-conditioned labelled random trees whose vertices are colored black or white.

Recommendations

• The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
• Trajectories in random minimal transposition factorizations
• Degrees in random uniform minimal factorizations
• Random generation and scaling limits of fixed genus factorizations into transpositions
• A geometric representation of fragmentation processes on stable trees

Cites work

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

Cited in

(6)

• Random generation and scaling limits of fixed genus factorizations into transpositions
• A geometric representation of fragmentation processes on stable trees
• The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
• Trajectories in random minimal transposition factorizations
• Degrees in random uniform minimal factorizations
• Minimal factorizations of a cycle: a multivariate generating function

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066873)