We survey multivariate limit theorems in the framework of the contraction method for recursive sequences as arising in the analysis of algorithms, random trees or branching processes. We compare and improve various general conditions under which limit laws can be obtained, state related open problems and give applications to the analysis of algorithms and branching recurrences
A general method is developed with which various theorems on the mean square convergence of function...
The asymptotic distribution of branching type recursions (L n ) of the form L n d = A L n\Gamma1 +...
In the present work we study limits of recursively entered sequence an+1 = f(an). We use two approac...
We survey multivariate limit theorems in the framework of the contraction method for recursive seq...
Recursive sequences of laws of random variables (and random vectors) are considered where an indepen...
Within the last thirty years, the contraction method has become an important tool for the distributi...
ABSTRACT. We show that an algorithmic construction of sequences of recursive trees leads to a direct...
AbstractA functional limit theorem is proved for multitype continuous time Markov branching processe...
Random recurrence relations are stochastic difference equations, which define recursively a sequence...
We propose an approach to analyze the asymptotic behavior of Pólya urns based on the contraction met...
AbstractWe consider distributional recursions which appear in the study of random binary search tree...
This paper suggests Lévy copulas in order to characterize the dependence among components of multidi...
We explore the relationship between branching processes and random sums of indicators. As a tool for...
International audienceA particular continuous-time multitype branching process is considered, it is ...
We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits f...
A general method is developed with which various theorems on the mean square convergence of function...
The asymptotic distribution of branching type recursions (L n ) of the form L n d = A L n\Gamma1 +...
In the present work we study limits of recursively entered sequence an+1 = f(an). We use two approac...
We survey multivariate limit theorems in the framework of the contraction method for recursive seq...
Recursive sequences of laws of random variables (and random vectors) are considered where an indepen...
Within the last thirty years, the contraction method has become an important tool for the distributi...
ABSTRACT. We show that an algorithmic construction of sequences of recursive trees leads to a direct...
AbstractA functional limit theorem is proved for multitype continuous time Markov branching processe...
Random recurrence relations are stochastic difference equations, which define recursively a sequence...
We propose an approach to analyze the asymptotic behavior of Pólya urns based on the contraction met...
AbstractWe consider distributional recursions which appear in the study of random binary search tree...
This paper suggests Lévy copulas in order to characterize the dependence among components of multidi...
We explore the relationship between branching processes and random sums of indicators. As a tool for...
International audienceA particular continuous-time multitype branching process is considered, it is ...
We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits f...
A general method is developed with which various theorems on the mean square convergence of function...
The asymptotic distribution of branching type recursions (L n ) of the form L n d = A L n\Gamma1 +...
In the present work we study limits of recursively entered sequence an+1 = f(an). We use two approac...