On The Joint Normality of Certain Statistics on Ordered Trees

2018/05/21 by Biers-Ariel, Yonah
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1805.08076

Abstract

We develop algorithms, implemented in Maple, that study the number of vertices with a particular number of children in a random ordered tree where all vertices must have a number of children in some finite set. By calculating the mixed moments of two such numbers, the package gives strong experimental evidence numbers are pairwise asymptotically normal.

Related

• Paired domination in trees: A linear algorithm and asymptotic normality
• Automated Counting and Statistical Analysis of Labeled Trees with Degree Restrictions
• On The Limiting Distributions of the Total Height On Families of Trees
• The number of occurrences of patterns in a random tree or forest permutation
• Exploring Werner Krandick's Binary Tree Jump Statistics