Random generation and scaling limits of fixed genus factorizations into transpositions

DOI10.1007/s00440-022-01170-9zbMath1504.05010arXiv2105.03284OpenAlexW3162327646MaRDI QIDQ2099811

Baptiste Louf, Paul Thévenin, Valentin Féray

Publication date: 18 November 2022

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

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

zbMATH Keywords

minimal factorizations of cycles into transpositionsrandom factorizations of the \(n\)-cycle

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple model of trees for unicellular maps
• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
• A new combinatorial identity for unicellular maps, via a direct bijective approach
• The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees
• Random trees and applications
• Scaling limits of bipartite planar maps are homeomorphic to the 2-sphere
• Arbres et processus de Galton-Watson. (Trees and Galton-Watson processes)
• A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
• Graphs on surfaces and their applications. Appendix by Don B. Zagier
• Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle)
• Toda equations for Hurwitz numbers
• Tree-like properties of cycle factorizations
• Hurwitz numbers and intersections on moduli spaces of curves.
• Factorizations of large cycles in the symmetric group
• Local limits of large Galton-Watson trees rerooted at a random vertex
• Some combinatorial problems associated with products of conjugacy classes of the symmetric group
• A geometric representation of fragmentation processes on stable trees
• The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
• Finite complex reflection arrangements are \(K(\pi,1)\)
• The continuum random tree. III
• Random sorting networks
• Invariance principle for variable speed random walks on trees
• Random stable laminations of the disk
• Gaussian fluctuations of characters of symmetric groups and of Young diagrams
• Random non-crossing plane configurations: A conditioned Galton-Watson tree approach
• Counting factorizations of Coxeter elements into products of reflections
• A Bijection for Rooted Maps on Orientable Surfaces
• Triangulating the Circle, at Random
• Weighted Hurwitz numbers and topological recursion: An overview
• The Archimedean limit of random sorting networks
• Simply Generated Non-Crossing Partitions
• Trajectories in random minimal transposition factorizations

This page was built for publication: Random generation and scaling limits of fixed genus factorizations into transpositions