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 &lt; n and project the leaf mass onto the subtree spanned by the first k leaves...

সম্পূর্ণ বিবরণ

গ্রন্থ-পঞ্জীর বিবরন
প্রধান লেখক: Forman, N, Pal, S, Rizzolo, D, Winkel, M
বিন্যাস: Journal article
ভাষা:English
প্রকাশিত: Wiley 2020