Thesis
Recursive construction of continuum random trees and some contributions to the theory of tree-valued stochastic processes
- Abstract:
-
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 high generality by Aldous and Bandyopadhyay. We further apply this recursive construction to "embed" Duquesne and Le Gall's stable tree into a binary compact CRT in a way that solves an open problem p...
Expand abstract
Actions
Funding
Bibliographic Details
- Type of award:
- DPhil
- Level of award:
- Doctoral
- Awarding institution:
- University of Oxford
Item Description
- Language:
- English
- Keywords:
- UUID:
-
uuid:b80e56c7-08a2-49ee-90cb-70607c1e150d
- Deposit date:
- 2016-08-18
Related Items
Terms of use
- Copyright holder:
- Rembart, F
- Copyright date:
- 2016
If you are the owner of this record, you can report an update to it here: Report update to this record