14th Northwest Probability Seminar - Schroeder's problems and random trees

In 1870 Schroeder introduced four problems concerning the enumeration of bracketings of words or sets of a given size. We will consider what uniform draws from these bracketings look like as the size of the word or set goes to infinity. Connections will be made to the recently developed theory of Markov branching trees as well as several types of conditioned Galton-Watson trees.

Joint work with Jim Pitman.

©2012 Microsoft Corporation. All rights reserved.
  • SpeakerDouglas Rizzolo
  • HostDavid Wilson
  • Duration00:34:23
  • Date recorded13 October 2012
  • Share
    Share this page on Facebook
    Share this page on Twitter
    Share this page on LinkedIn
    E-mail this page
    RSS feeds