__Claremont Graduate University__ | __Claremont McKenna__ | __Harvey Mudd__ | __Pitzer__ | __Pomona__ | __Scripps__

Proudly Serving Math Community at the Claremont Colleges Since 2007

Copyright © 2011 Claremont Center for the Mathematical Sciences

When

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

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

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

Category

Colloquium

Speaker

Douglas P. Rizzolo, University of Washington

Abstract

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?

Where

Beckman B126, Harvey Mudd College

Attachment | Size |
---|---|

Rizzolo.pdf | 92.65 KB |