The Asymptotic Properties of random trees

Start: 02/27/2013 - 4:15pm
End  : 02/27/2013 - 5:15pm


Douglas P. Rizzolo, University of Washington


The study of random trees dates back at least to the 1800’s when they were used to analyze the statistical properties of family trees. Since then these trees and related models have continued to appear in population biology and have also shown up in computer science and statistical mechanics, among other fields. In this talk we will look at how to determine statistical properties of random trees as their size grows to infinity. In particular, we will consider questions like: How high is a random leaf in a random rooted binary tree?

Beckman B126, Harvey Mudd College

Rizzolo.pdf92.65 KB

Claremont Graduate University | Claremont McKenna | Harvey Mudd | Pitzer | Pomona | Scripps
Proudly Serving Math Community at the Claremont Colleges Since 2007
Copyright © 2018 Claremont Center for the Mathematical Sciences