Probability Seminar
Thursday, February 16, 2017, 3:15pm, 119 Physics
Tobias Johnson (Courant Institute)
Galton-Watson fixed points, tree automata, and interpretations
Abstract:
Consider a set of trees such that a tree belongs to the set if and only if at least two of its root child subtrees do. One example is the set of trees that contain an infinite binary tree starting at the root. Another example is the empty set. Are there any other sets satisfying this property other than trivial modifications of these? I'll demonstrate that the answer is no, in the sense that any other such set of trees differs from one of these by a negligible set under a Galton-Watson measure on trees, resolving an open question of Joel Spencer's. This follows from a theorem that allows us to answer questions of this sort in general. All of this is part of a bigger project to understand the logic of Galton-Watson trees, which I'll tell you more about. Joint work with Moumanti Podder and Fiona Skerman. [video]

Generated at 1:31am Friday, March 29, 2024 by Mcal.   Top * Reload * Login