Journal article
A binary embedding of the stable line-breaking construction
- Abstract:
- We embed Duquesne and Le Gall’s stable tree into a binary compact continuum random tree (CRT) in a way that solves an open problem posed by Goldschmidt and Haas. This CRT can be obtained by applying a recursive construction method of compact CRTs as presented in earlier work to a specific distribution of a random string of beads, i.e. a random interval equipped with a random discrete measure. We also express this CRT as a tree built by replacing all branch points of a stable tree by i.i.d. copies of a Ford CRT, each rescaled by a factor intrinsic to the stable CRT.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, pdf, 2.0MB, Terms of use)
-
- Publisher copy:
- 10.1016/j.spa.2023.06.007
Authors
+ Engineering and Physical Sciences Research Council
More from this funder
- Funder identifier:
- http://dx.doi.org/10.13039/501100000266
- Grant:
- EP/K029797/1
- EP/P505666/1
- Publisher:
- Elsevier
- Journal:
- Stochastic Processes and their Applications More from this journal
- Volume:
- 163
- Pages:
- 424-472
- Publication date:
- 2023-06-16
- Acceptance date:
- 2023-06-12
- DOI:
- EISSN:
-
1879-209X
- ISSN:
-
0304-4149
- Language:
-
English
- Keywords:
- Pubs id:
-
1407171
- Local pid:
-
pubs:1407171
- Deposit date:
-
2023-06-16
Terms of use
- Copyright holder:
- Rembart and Winkel
- Copyright date:
- 2023
- Rights statement:
- © 2023 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
- Notes:
- For the purpose of Open Access, the authors have applied a CC BY public copyright licence to any Author Accepted Manuscript (AAM) version arising from this submission.
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record