Strong convergence of infinite color balanced urns under uniform ergodicity

We consider the generalization of the Pólya urn scheme with possibly infinitely many colors, as introduced in [37], [4], [5], and [6]. For countably many colors, we prove almost sure convergence of the urn configuration under the uniform ergodicity assumption on the associated Markov chain. The proof uses a stochastic coupling of the sequence of chosen colors with a branching Markov chain on a weighted random recursive tree as described in [6], [31], and [26]. Using this coupling we estimate the covariance between any two selected colors. In particular, we re-prove the limit theorem for the classical urn models with finitely many colors.

Asymptotic results on Hoppe trees and their variations

A uniform recursive tree on n vertices is a random tree where each possible $(n-1)!$ labelled recursive rooted tree is selected with equal probability. We introduce and study weighted trees, a non-uniform recursive tree model departing from the recently introduced Hoppe trees. This class generalizes both uniform recursive trees and Hoppe trees, providing diversity among the nodes and making the model more flexible for applications. We analyse the number of leaves, the height, the depth, the number of branches, and the size of the largest branch in these weighted trees.

Site Frequency Spectrum of the Bolthausen-Sznitman Coalescent

We derive explicit formulas for the two first moments of he site frequency spectrum (SFSn,b)1≤b≤n−1 of the Bolthausen-Sznitman coalescent along with some precise and efficient approximations, even for small sample sizes n. These results provide new L2-asymptotics for some values of b = o(n). We also study the length of internal branches carrying b > n/2 individuals. In this case we obtain the distribution function and a convergence in law. Our results rely on the random recursive tree construction of the Bolthausen-Sznitman coalescent.