Add to ORKGWe study the bijection between binary Galton–Watson trees in continuous time and their exploration process, both in the sub- and in the supercritical cases. We then take the limit over renormalized quantities, as the size of the population tends to infinity. We thus deduce Delmas ’ generalization of the second Ray–Knight theorem
The Brownian motion has played an important role in the development of probability theory and stocha...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
Companion paper of arXiv:math.PR/0410211We present new links between some remarkable martingales fou...
International audienceWe study the bijection between binary Galton--Watson trees in continuous time ...
We study both a continuous time non-binary Galton−Watson random tree and its exploration (or height)...
Dans cette thèse, on étudie la convergence du processus d'exploration de l'arbre généalogique d'un p...
Dans cette thèse, on étudie des liens entre processus d'exploration et arbres aléatoires avec ou san...
We introduce a simple technique for proving the transience of certain processes defined on the random...
Binary trees are grown by adding one node at a time, an available node at height i being added with ...
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursiv...
We discuss a notion of convergence for binary trees that is based on subtreesizes. In analogy to rec...
41 pages, 2 figuresInternational audienceWe study the evolution of a particle system whose genealogy...
We construct random locally compact real trees called Levy trees that are the genealogical trees ass...
Mappings between trees and piece-wise linear functions are well-known and used in combinatorics and ...
We are interested in the asymptotic analysis of the binary search tree (BST) under the random permut...
The Brownian motion has played an important role in the development of probability theory and stocha...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
Companion paper of arXiv:math.PR/0410211We present new links between some remarkable martingales fou...
International audienceWe study the bijection between binary Galton--Watson trees in continuous time ...
We study both a continuous time non-binary Galton−Watson random tree and its exploration (or height)...
Dans cette thèse, on étudie la convergence du processus d'exploration de l'arbre généalogique d'un p...
Dans cette thèse, on étudie des liens entre processus d'exploration et arbres aléatoires avec ou san...
We introduce a simple technique for proving the transience of certain processes defined on the random...
Binary trees are grown by adding one node at a time, an available node at height i being added with ...
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursiv...
We discuss a notion of convergence for binary trees that is based on subtreesizes. In analogy to rec...
41 pages, 2 figuresInternational audienceWe study the evolution of a particle system whose genealogy...
We construct random locally compact real trees called Levy trees that are the genealogical trees ass...
Mappings between trees and piece-wise linear functions are well-known and used in combinatorics and ...
We are interested in the asymptotic analysis of the binary search tree (BST) under the random permut...
The Brownian motion has played an important role in the development of probability theory and stocha...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
Companion paper of arXiv:math.PR/0410211We present new links between some remarkable martingales fou...