Central Limit Theorems for Additive Tree Parameters with Small Toll Functions. (8th September 2014)

• Record Type: Journal Article
• Authors: WAGNER, STEPHAN
• Editors: Broutin, Nicolas; Fill, James Allen; Nebel, Markus; Ward, Mark Daniel
• Is Part Of: Combinatorics, probability and computing. Volume 24:Number 1(2015:Jan.)
• Page Start: 329
• Page End: 353
• Publication Date: 2014-09-08
• Subjects: Primary 60C05, -- Secondary 05A16, -- 05C05, -- 05C80, -- 60F05; Combinatorial analysis -- Periodicals; Probabilities -- Periodicals; Computer science -- Mathematics -- Periodicals; 511.6
• DOI: 10.1017/S0963548314000443
• Languages: English
• ISSNs: 0963-5483

Abstract

Abstract : We call a tree parameter additive if it can be determined recursively as the sum of the parameter values of all branches, plus a certain toll function. In this paper, we prove central limit theorems for very general toll functions, provided that they are bounded and small on average. Simply generated families of trees are considered as well as Pólya trees, recursive trees and binary search trees, and the results are illustrated by several examples of parameters for which we prove normal or log-normal limit laws.