Recursive construction of continuum random trees and some contributions to the theory of tree-valued stochastic processes
<p>We introduce a general recursive method to construct continuum random trees (CRTs) from i.i.d. copies of a string of beads, that is, any random interval equipped with a random discrete measure. We prove the existence of these CRTs as a new application of the fixpoint method formalised in...
Main Author: | Rembart, F |
---|---|
Other Authors: | Winkel, M |
Format: | Thesis |
Language: | English |
Published: |
2016
|
Similar Items
-
Recursive construction of continuum random trees
by: Rembart, F, et al.
Published: (2018) -
Branch merging on continuum trees with applications to regenerative tree growth
by: Rembart, F
Published: (2016) -
A recursive distribution equation for the stable tree
by: Chee, N, et al.
Published: (2024) -
Random recursive trees and the Bolthausen-Sznitman coalescent
by: Goldschmidt, C
Published: (2005) -
Random recursive trees and the Bolthausen-Sznitman coalescent
by: Goldschmidt, C, et al.
Published: (2005)