注：随机到前面洗牌上树
Note: Random-to-front shuffles on trees
摘要：
一个马尔可夫链被认为是一个潜在的固定树的状态是排序和其过渡是本地的“随机前”重新排序，由概率分布的子集上的叶子。利用半群上的布朗随机游动理论确定了转移阵的特征值。
英文摘要：
A Markov chain is considered whose states are orderings of an underlying fixed tree and whose transitions are local "random-to-front" reorderings, driven by a probability distribution on subsets of the leaves. The eigenvalues of the transition matrix are determined using Brown's theory of random walk on semigroups.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
