Abstract
In this third chapter we will present methods for counting trees that are based on the concept of generating functions. First we derive explicit formulas for basic tree classes and asymptotic formulas for simply generated trees and PĆ³lya trees. However, the main goal is to show that certain tree parameters that behave additively (in a proper sense) satisfy a central limit theorem in a natural probabilistic setting.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
Ā© 2009 Springer-Verlag/Wien
About this chapter
Cite this chapter
(2009). Advanced Tree Counting. In: Random Trees. Springer, Vienna. https://doi.org/10.1007/978-3-211-75357-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-211-75357-6_3
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-75355-2
Online ISBN: 978-3-211-75357-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)