We consider smoothing equations of the form X~=\limits^ law~ ∑ _ j ≥ 1 T_j X_j+ CX=
law∑ j≥ 1 T j X j+ C where (C, T_1, T_2, ...)(C, T 1, T 2,…) is a given sequence of random …

The present paper aims at describing in details the asymptotic composition of a class of d-
colour P\'olya urn: namely balanced, tenable and irreducible urns. We decompose the …

We consider systems of stochastic fixed point equations that arise in the asymptotic analysis
of random recursive structures and algorithms such as Quicksort, large Pólya urn processes …

The present paper aims at describing in details the asymptotic composition of a class of d-
colour Pólya urns: namely balanced, tenable and irreducible urns. We decompose the …

A $ B $-tree is a type of search tree where every node (except possibly for the root) contains
between $ m $ and $2 m $ keys for some positive integer $ m $, and all leaves have the …

The asymptotic behaviour of a generalised P\'olya--Eggenberger urn is well--known to
depend on the spectrum of its replacement matrix: If its dominant eigenvalue $ r $ is simple …

Trees are a fundamental object in graph theory and combinatorics as well as a basic object
for data structures and algorithms in computer science. During the last few decades …

Urn models are simple examples for random growth processes that involve various
competing types. In the study of these schemes, one is generally interested in the impact of …

Nous présentons ici le modèle des urnes de Pólya et les analyses qui s' ensuivent. Les
motivations algorithmiques viennent de l'utilisation de ce modèle pour l'étude des arbres m …

Ce chapitre paraîtra peut-être moins formalisé que d'autres; cela nous a semblé nécessaire
pour aller vers des préoccupations pratiques algorithmiques. Nous regardons dans ce …