Incorporating a collection of recent results, Polya Urn Models deals with discrete probability
through the modern and evolving urn theory and its numerous applications. It looks at how …

A functional limit theorem is proved for multitype continuous time Markov branching
processes. As consequences, we obtain limit theorems for the branching process stopped …

Limit laws are proven by the contraction method for random vectors of a recursive nature as
they arise as parameters of combinatorial structures such as random trees or recursive …

This paper reviews P´ olya urn models and their connection to random trees. Basic results
are presented, together with proofs that underly the historical evolution of the accompanying …

The distributions of vertex degrees in random recursive trees and random plane recursive
trees are shown to be asymptotically normal. Formulas are given for the asymptotic …

We characterize all limit laws of the quicksort-type random variables defined recursively by
\calL(X_n)=\calL(X_I_n+X^*_n-1-I_n+T_n) when the" toll function" Tn varies and satisfies …

This survey studies asymptotics of random fringe trees and extended fringe trees in random
trees that can be constructed as family trees of a Crump–Mode–Jagers branching process …

We present a toolbox for extracting asymptotic information on the coefficients of
combinatorial generating functions. This toolbox notably includes a treatment of the effect of …

Pólya processes are natural generalizations of Pólya–Eggenberger urn models. This article
presents a new approach of their asymptotic behaviour via moments, based on the spectral …

We prove convergence in distribution for the profile (the number of nodes at each level),
normalized by its mean, of random recursive trees when the limit ratio α of the level and the …