Binary search trees of permuton samples

DOI10.1016/J.AAM.2024.102774MaRDI QIDQ6632115zbMATH OpenFDO

Authors Benoît Corsini, Valentin Féray

Publication date 4 November 2024

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

zbMATH Keywords

random permutationsbinary search treespermutons

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 852055
• The height of record‐biased trees
• scientific article; zbMATH DE number 1080355
• Martingales and profile of binary search trees
• On the subtree size profile of binary search trees

Cites work

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

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)