Schroeder's problems and random trees

Channel:
Microsoft Research
Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=rfuLzwb-tDw


Duration: 34:24
124 views
1

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.



Other Videos By Microsoft Research


2016-07-18Microsoft Design Expo 2016
2016-07-18Microsoft Design Expo 2016: University of California, Los Angeles
2016-07-18Microsoft Design Expo 2016: University of Dundee
2016-07-18Microsoft Design Expo 2016: New York University
2016-07-18Microsoft Design Expo 2016: ArtCenter College of Design
2016-07-18Microsoft Design Expo 2016: Umea Institute of Design
2016-07-18Microsoft Design Expo 2016: Carnegie Mellon University
2016-07-18Microsoft Design Expo 2016: University of Washington
2016-07-18Microsoft Design Expo 2016: University of Southern California
2016-07-15Fusion4D: Real-time Performance Capture of Challenging Scenes
2016-07-15Schroeder's problems and random trees
2016-07-14Oded Schramm Memorial Conference: Day One, Session Two
2016-07-14Oded Schramm Memorial Conference: Day One, Session One
2016-07-14Oded Schramm Memorial Conference: Day Two, Session Four
2016-07-14Oded Schramm Memorial Conference: Day One, Session Three
2016-07-14Oded Schramm Memorial Conference: Day Two, Session Three
2016-07-14Oded Schramm Memorial Conference: Day Two, Session One
2016-07-14Oded Schramm Memorial Conference: Day One, Session Four
2016-07-14Oded Schramm Memorial Conference: Day Two, Session Two
2016-07-14Thomas Karagiannis, Senior Researcher
2016-07-14Austin Donnelly, Principal RSDE


Tags:
microsoft research