Random stable-type minimal factorizations of the n-cycle

DOI10.1017/APR.2021.21zbMATH Open1500.60004arXiv2002.12027OpenAlexW4213418259WikidataQ114119648 ScholiaQ114119648MaRDI QIDQ5066873FDOQ5066873

Authors: Paul Thévenin 

Publication date: 31 March 2022

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

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.

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

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

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)

Cites Work

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

Cited In (6)

• Random generation and scaling limits of fixed genus factorizations into transpositions
• A geometric representation of fragmentation processes on stable trees
• Trajectories in random minimal transposition factorizations
• The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
• 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)