Aldous链在二叉树上的投影:交织和一致性
Projections of the Aldous chain on binary trees: Intertwining and consistency
摘要:
考虑带有$n$标记叶子的有根二叉树空间上的Aldous马尔可夫链,其中在每个转移处,均匀随机叶子被删除并重新附着到均匀随机边缘。现在,修复$1\le k < n$并将叶质量投影到第一个$k$叶所跨越的子树上。这就产生了一个带有边权重的二叉树,我们称之为“带有总质量$n$的修饰$k$树”。“我们为Aldous链引入标签交换动力学,以便当它在平稳性中运行时,装饰的$k$树本身作为马尔可夫链进化,并且在$k\le n$上投影一致。投射一致链的构建是本作者在连续树上构建Aldous扩散的关键步骤,这是Aldous链的$n\rightarrow \infty$连续模拟,并将在其他地方进行。我们的一些结果已被推广到福特的阿尔法模型树。
英文摘要:
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\le k < n$ and project the leaf mass onto the subtree spanned by the first $k$ leaves. This yields a binary tree with edge weights that we call a "decorated $k$-tree with total mass $n$." We introduce label swapping dynamics for the Aldous chain so that, when it runs in stationarity, the decorated $k$-trees evolve as Markov chains themselves, and are projectively consistent over $k\le n$. The construction of projectively consistent chains is a crucial step in the construction of the Aldous diffusion on continuum trees by the present authors, which is the $n\rightarrow \infty$ continuum analogue of the Aldous chain and will be taken up elsewhere. Some of our results have been generalized to Ford's alpha model trees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。