Numerical Approach to Central Limit Theorem for Bifurcation Ratio of Random Binary Tree

Abstract

A central limit theorem for binary tree is numerically examined. Two types of central limit theorem for higher-order branches are formulated. A topological structure of a binary tree is expressed by a binary sequence, and the Horton-Strahler indices are calculated by using the sequence. By fitting the Gaussian distribution function to our numerical data, the values of variances are determined and written in simple forms.

References in corpus (1)

• On the topological classification of binary trees using the Horton-Strahler index

Cited by in corpus (2)

• Topological self-similarity on the random binary-tree model
• Reductions of Binary Trees and Lattice Paths induced by the Register Function