Trajectories in random minimal transposition factorizations
From MaRDI portal
Publication:5742626
zbMath1423.60023arXiv1810.07586MaRDI QIDQ5742626
Igor Kortchemski, Valentin Féray
Publication date: 15 May 2019
Full work available at URL: https://arxiv.org/abs/1810.07586
Trees (05C05) Permutations, words, matrices (05A05) Combinatorial probability (60C05) Functional limit theorems; invariance principles (60F17)
Related Items (6)
Random stable-type minimal factorizations of the n-cycle ⋮ A geometric representation of fragmentation processes on stable trees ⋮ Degrees in random uniform minimal factorizations ⋮ The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees ⋮ Random generation and scaling limits of fixed genus factorizations into transpositions ⋮ Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- 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
- Tree-like properties of cycle factorizations
- The local limit of random sorting networks
- Non-crossing trees, quadrangular dissections, ternary trees, and duality-preserving bijections
- Random sorting networks: local statistics via random matrix laws
- The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
- Labelled trees and factorizations of a cycle into transpositions
- Random sorting networks
- Local limits of conditioned Galton-Watson trees: the infinite spine case
- Probability on Trees and Networks
- Random Graphs and Complex Networks
- The Archimedean limit of random sorting networks
This page was built for publication: Trajectories in random minimal transposition factorizations
