Permutations in binary trees and split trees

DOI10.4230/LIPICS.AOFA.2018.9MaRDI QIDQ4993531zbMATH OpenOpenAlexFDO

Authors Cecilia Holmgren, Tony Johansson, Fiona Skerman, Michael Albert

Publication date 15 June 2021

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

zbMATH Keywords

permutationscumulantrandom treesinversionssplit trees

Mathematics Subject Classification ID

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

Abstract: We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It also generalises some recent results on the number of inversions in randomly labelled trees. We consider complete binary trees as well as random split trees a large class of random trees of logarithmic height introduced by Devroye in 1998. Split trees consist of nodes (bags) which can contain balls and are generated by a random trickle down process of balls through the nodes. For complete binary trees we show that asymptotically the cumulants of the number of occurrences of a fixed permutation in the random node labelling have explicit formulas. Our other main theorem is to show that for a random split tree, with high probability the cumulants of the number of occurrences are asymptotically an explicit parameter of the split tree. For the proof of the second theorem we show some results on the number of embeddings of digraphs into split trees which may be of independent interest.

Recommendations

• Embedding small digraphs and permutations in binary trees and split trees
• Inversions in split trees and conditional Galton-Watson trees
• Inversions in split trees and conditional Galton-Watson trees
• Counting labels in binary trees
• Novel characteristics of split trees by use of renewal theory

Cites work

• scientific article; zbMATH DE number 3233336 (Why is no real title available?)
• Novel characteristics of split trees by use of renewal theory
• Quad trees: A data structure for retrieval by composite keys
• The total path length of split trees
• Universal Limit Laws for Depths in Random Trees
• Weighted height of random trees

Cited in

(9)

• scientific article; zbMATH DE number 871445 (Why is no real title available?)
• scientific article; zbMATH DE number 5130543 (Why is no real title available?)
• Some simple varieties of trees arising in permutation analysis
• Increasing trees and alternating permutations
• Inversions in split trees and conditional Galton-Watson trees
• Inversions in split trees and conditional Galton-Watson trees
• Embedding small digraphs and permutations in binary trees and split trees
• Permutation representation of k-ary trees
• Perfect trees and bit-reversal permutations

Describes a project that uses

Uses Software

• Quicksort

This page was built for publication: Permutations in binary trees and split trees

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