Projections of the Aldous chain on binary trees: Intertwining and consistency
<p>Consider the Aldous Markov chain on the space of rooted binary trees with n labeled leaves in which at each transition a uniform random leaf is deleted and reattached to a uniform random edge. Now, fix 1 ≤ k < n and project the leaf mass onto the subtree spanned by the first k leaves...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Wiley
2020
|