Additive functionals of dd-ary increasing trees

preprint2016arXivOpen access

Abstract

A tree functional is called additive if it satisfies a recursion of the form F(T)=∑j=1kF(Bj)+f(T)F(T) = \sum_{j=1}^k F(B_j) + f(T), where B1,…,BkB_1,\ldots,B_k are the branches of the tree TT and f(T)f(T) is a toll function. We prove a general central limit theorem for additive functionals of dd-ary increasing trees under suitable assumptions on the toll function. The same method also applies to generalised plane-oriented increasing trees (GPORTs). One of our main applications is a log-normal law that we prove for the size of the automorphism group of dd-ary increasing trees, but many other examples (old and new) are covered as well.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.