Differences

This shows you the differences between two versions of the page.

--- seminars:stat:191121 [2019/11/13 22:03] – created qyu
+++ seminars:stat:191121 [2019/11/13 22:04] (current) – qyu
@@ Line 1: / Line 1: @@
+<WRAP centeralign>##Statistics Seminar##\\ Department of Mathematical Sciences</WRAP>
+<WRAP 70% center>
+^  **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  |
+</WRAP>
+\\
+<WRAP center box 80%>
+<WRAP centeralign>**Abstract**</WRAP>
+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.
+</WRAP>