Binary search trees of permuton samples

DOI10.1016/J.AAM.2024.102774MaRDI QIDQ6632115FDOQ6632115

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)

Cites Work

• Limits of permutation sequences
• NON-NULL RANKING MODELS. I
• Thermodynamic limit for the Mallows model on \(S_n\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On growing random binary trees
• A note on the height of binary search trees
• Limiting curves for i.i.d. records
• The length of the longest increasing subsequence of a random Mallows permutation
• Entropy and maximal spacings for random partitions
• Large deviations for increasing sequences on the plane
• Universal limits of substitution-closed permutation classes
• The height of Mallows trees
• 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)