Előadó: Antar Bandyopadhyay (Indian Statistical Institute, Delhi)
In this talk, we will establish a connection between random recursive tree, branching Markov chain and urn model. Exploring the connection further we will derive fairly general scaling limits for urn models with colors indexed by a Polish Space and show that several exiting results on classical/non-classical urn schemes can be easily derived out of such general asymptotic. We will further show that the connection can be used to derive exact asymptotic for the sizes of the connected components of a random recursive forest, obtained by removing the root of a random recursive tree.
This is a joint work with Debleena Thacker.