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: | , , , |
|---|---|
| 格式: | Journal article |
| 語言: | English |
| 出版: |
Wiley
2020
|