The height of record‐biased trees

DOI10.1002/rsa.21110zbMath1522.05035arXiv2112.05732MaRDI QIDQ6074878

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

random treesbinary search treesrandom permutationsheights of treesrecord-biased permutationsrecord-biased trees

Mathematics Subject Classification ID

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

Cites Work

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

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