Recursive construction of continuum random trees and some contributions to the theory of tree-valued stochastic processes
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 genera...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
University of Oxford
2016
|
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.728789 |