Projections of the Aldous chain on binary trees: Intertwining and consistency

RANDOM STRUCTURES & ALGORITHMS(2020)

引用 7|浏览7
暂无评分
摘要
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 <= kinfinity continuum analog of the Aldous chain and will be taken up elsewhere.
更多
查看译文
关键词
Aldous diffusion,down-up chain,intertwining,Markov chains on binary trees,Remy tree growth,strings of beads,trees with edge-weights
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要