Binary search trees of permuton samples

DOI10.1016/j.aam.2024.102774MaRDI QIDQ6632115

Benoît Corsini, [[Person:6204685|Author name not available (Why is that?)]], Valentin Féray

Publication date: 4 November 2024

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

zbMATH Keywords

binary search treesrandom permutationspermutons

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The length of the longest increasing subsequence of a random Mallows permutation
• On growing random binary trees
• Large deviations for increasing sequences on the plane
• Limiting curves for i.i.d. records
• Limits of permutation sequences
• The height of Mallows trees
• Universal limits of substitution-closed permutation classes
• NON-NULL RANKING MODELS. I
• Thermodynamic limit for the Mallows model on Sn
• A note on the height of binary search trees
• Entropy and maximal spacings for random partitions
• The height of record‐biased trees
• Monotone subsequences in locally uniform random permutations
• Ranks, copulas, and permutons
• A note on limits of sequences of binary trees
• Locally uniform random permutations with large increasing subsequences
• Increasing subsequences of linear size in random permutations and the Robinson-Schensted tableaux of permutons

This page was built for publication: Binary search trees of permuton samples

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