We investigate the number of permutations that occur in random node labellings of trees. This is a generalisation of the number of subpermutations occuring in a random permutation. It also generalises some recent results on the number of inversions in randomly labelled trees [Cai et al., 2017]. We consider complete binary trees as well as random split trees a large class of random trees of logarithmic height introduced by Devroye [Devroye, 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.
[1]
Luc Devroye,et al.
Weighted height of random trees
,
2008,
Acta Informatica.
[2]
Svante Janson,et al.
Inversions in Split Trees and Conditional Galton–Watson Trees
,
2017,
Combinatorics, Probability and Computing.
[3]
Jon Louis Bentley,et al.
Quad trees a data structure for retrieval on composite keys
,
1974,
Acta Informatica.
[4]
Cecilia Holmgren,et al.
Novel characteristics of split trees by use of renewal theory
,
2010,
1005.4594.
[5]
Nicolas Broutin,et al.
The total path length of split trees
,
2011,
ArXiv.
[6]
Luc Devroye.
Universal Limit Laws for Depths in Random Trees
,
1998,
SIAM J. Comput..