The height of record‐biased trees

DOI10.1002/RSA.21110MaRDI QIDQ6074878zbMATH OpenFDO

Authors Benoît Corsini

Publication date 19 October 2023

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2112.05732

zbMATH Keywords

binary search treesheights of treesrandom permutationsrandom treesrecord-biased permutationsrecord-biased trees

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Abstract: Given a permutation $sigma$, its corresponding binary search tree is obtained by recursively inserting the values $sigma(1),ldots,sigma(n)$ into a binary tree so that the label of each node is larger than the labels of its left subtree and smaller than the labels of its right subtree. In 1986, Devroye proved that the height of such trees when $sigma$ is a random uniform permutation is of order $(c^{\ast }+o_{m}athbbP(1))logn$ as $n$ tends to infinity, where $c^{\ast }$ is the only solution to $clog(2e/c)=1$ with $cgeq2$. In this paper, we study the height of binary search trees drawn from the record-biased model of permutations, introduced by Auger, Bouvel, Nicaud, and Pivoteau in 2016. The record-biased distribution is the probability measure on the set of permutations whose weight is proportional to $het{a}^{mathrmrecord(sigma)}$, where $mathrmrecord(sigma)=|iin[n]:forallj<i,sigma(i)>sigma(j)|$. We show that the height of a binary search tree built from a record-biased permutation of size $n$ with parameter $heta$ is of order $(1+o_{m}athbbP(1))max{c}^{\ast }logn,,hetalog(1+n/heta)$, hence giving a full characterization of the first order asymptotic behaviour of the height of such trees.

Recommendations

• A note on the height of binary search trees
• An analytic approach to the height of binary search trees
• scientific article; zbMATH DE number 852055
• The height of Mallows trees
• The height of a binary search tree: the limiting distribution perspective.

Cites work

• A note on the height of binary search trees
• An analytic approach to the height of binary search trees. II
• Convergence in law of the minimum of a branching random walk
• Limit distributions for minimal displacement of branching random walks
• Logarithmic combinatorial structures: A probabilistic approach
• Minima in branching random walks
• Minimal position and critical martingale convergence in branching random walks, and directed polymers on disordered trees
• NON-NULL RANKING MODELS. I
• On growing random binary trees
• On the Netto Inversion Number of a Sequence
• Postulates for subadditive processes
• Regenerative random permutations of integers
• The first birth problem for an age-dependent branching process
• The first- and last-birth problems for a multitype age-dependent branching process
• The height of a random binary search tree
• The height of increasing trees
• The height of increasing trees
• The height of Mallows trees
• The sampling theory of selectively neutral alleles
• Trickle-down processes and their boundaries

Cited in

(4)

• The height of Mallows trees
• Binary search trees of permuton samples
• Binary search trees of permuton samples
• Heights of butterfly trees

This page was built for publication: The height of record‐biased trees

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