The permuton limit of random recursive separable permutations
From MaRDI portal
Recommendations
Cites work
- An elementary proof of the triangle inequality for the Wasserstein metric
- Analytic combinatorics
- Baxter permuton and Liouville quantum gravity
- Convex Hulls of Random Order Types
- Degree sequence of random permutation graphs
- Graphon convergence of random cographs
- Limits of permutation sequences
- Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
- Note on the heights of random recursive trees and random m‐ary search trees
- On the Brownian separable permuton
- Pattern matching for permutations
- Random cographs: Brownian graphon limit and asymptotic degree distribution
- Random recursive triangulations of the disk via fragmentation theory
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- The Brownian limit of separable permutations
- The continuum random tree. III
- The infinite limit of separable permutations
- The skew Brownian permuton: A new universality class for random constrained permutations
- Triangulating the Circle, at Random
- Two first-order logics of permutations
- Universal limits of substitution-closed permutation classes
Cited in
(3)
This page was built for publication: The permuton limit of random recursive separable permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6491318)