**Problem of the Week**

**BUGCAT**

**Zassenhaus Conference**

**Hilton Memorial Lecture**

**BingAWM**

**Math Club**

seminars:stat:191121

Statistics Seminar

Department of Mathematical Sciences

DATE: | Thursday, November 21, 2019 |
---|---|

TIME: | 1:15pm – 2:15pm |

LOCATION: | WH 100E |

SPEAKER: | Yingsong Chen, Binghamton University |

TITLE: | Recursive Self-Similarity for Random Trees, Random Triangulations and Brownian Excursion |

**Abstract**

Recursive self-similarity for a random object is the property of being decomposable into independent rescaled copies of the original object. Certain random combinatorial objects–trees and triangulations–possess approximate versions of recursive self-similarity, and then their continuous limits possess exact recursive self-similarity. In particular, since the limit continuum random tree can be identified with Brownian excursion, we get a nonobvious recursive self-similarity property for Brownian excursion.

seminars/stat/191121.txt · Last modified: 2019/11/13 17:04 by qyu

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported