We construct a coupling between two seemingly very di erent constructions of the standard additive coalescent, which describes the evolution of masses merging pairwise at rates proportional to their sums. The rst construction, due to Aldous & Pitman, involves the components obtained by logging the Brownian Continuum Random Tree (CRT) by a Poissonian rain on its skeleton as time increases. The second one, due to Bertoin, involves the excursions above its running in mum of a linear-drifted standard Brownian excursion as its drift decreases. Our main tool is the use of an exploration algorithm of the so-called cut-tree of the Brownian CRT, which is a tree that encodes the genealogy of the fragmentation of the CRT
We introduce a family of branch merging operations on continuum trees and show that Ford CRTs are di...
Aldous and Pitman have studied the asymptotic behavior of the additive coalescent processes using a ...
International audienceConsidering a random binary tree with $n$ labelled leaves, we use a pruning pr...
We construct a coupling between two seemingly very di erent constructions of the standard additive c...
Regard an element of the set of ranked discrete distributions Δ := {(x1, x2,. . .) : x1 ≥ x2 ≥ . . ....
International audienceWe revisit the discrete additive and multiplicative coalescents, starting with...
Regard an element of the set Δ := {(x1, x2, . . .): x1 ≥ x2 ≥ ⋯ ≥ 0, ∑i xi = 1} as a fragmentation o...
International audienceConsider the logging process of the Brownian continuum random tree (CRT) $\cal...
Membres du Jury: Jean Bertoin, Jean-Francois Le Gall, Yves Le Jan, Yuval Peres (rapporteur), Alain R...
Let (Bt(s), 0 ≤ s < ∞) be reflecting inhomogeneous Brownian motion with drift t - s at time s, st...
We describe a representation of the Bolthausen-Sznitman coalescent in terms of the cutting of random...
We consider fragmentations of an R-tree T driven by cuts arriving according to a Poisson process on ...
We describe a simple construction of Kingman's coalescent in terms of a Brownian excursion. This con...
We introduce the multiplicative coalescent with linear deletion, a continuous-time Markov process de...
Coalescents with multiple collisions, also known as A-coalescents, were introduced by Pitman and Sag...
We introduce a family of branch merging operations on continuum trees and show that Ford CRTs are di...
Aldous and Pitman have studied the asymptotic behavior of the additive coalescent processes using a ...
International audienceConsidering a random binary tree with $n$ labelled leaves, we use a pruning pr...
We construct a coupling between two seemingly very di erent constructions of the standard additive c...
Regard an element of the set of ranked discrete distributions Δ := {(x1, x2,. . .) : x1 ≥ x2 ≥ . . ....
International audienceWe revisit the discrete additive and multiplicative coalescents, starting with...
Regard an element of the set Δ := {(x1, x2, . . .): x1 ≥ x2 ≥ ⋯ ≥ 0, ∑i xi = 1} as a fragmentation o...
International audienceConsider the logging process of the Brownian continuum random tree (CRT) $\cal...
Membres du Jury: Jean Bertoin, Jean-Francois Le Gall, Yves Le Jan, Yuval Peres (rapporteur), Alain R...
Let (Bt(s), 0 ≤ s < ∞) be reflecting inhomogeneous Brownian motion with drift t - s at time s, st...
We describe a representation of the Bolthausen-Sznitman coalescent in terms of the cutting of random...
We consider fragmentations of an R-tree T driven by cuts arriving according to a Poisson process on ...
We describe a simple construction of Kingman's coalescent in terms of a Brownian excursion. This con...
We introduce the multiplicative coalescent with linear deletion, a continuous-time Markov process de...
Coalescents with multiple collisions, also known as A-coalescents, were introduced by Pitman and Sag...
We introduce a family of branch merging operations on continuum trees and show that Ford CRTs are di...
Aldous and Pitman have studied the asymptotic behavior of the additive coalescent processes using a ...
International audienceConsidering a random binary tree with $n$ labelled leaves, we use a pruning pr...