arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1307.7499math.PRmath.COmath.GR
收藏

提升算子的马尔可夫链

Markov chains for promotion operators

Arvind Ayyer, Steven Klee, Anne Schilling

摘要:

我们考虑Schuetzenberger推广算子在有限偏序集的线性扩张集L上的推广。这就产生了L上的强连通图。在早期的工作(arXiv:1205.7074)中,我们研究了这些线性扩展上的基于提升的马尔可夫链,推广了Tsetlin库上的结果。利用R-平凡幺半群的理论,我们得到了一般偏序集为根森林时转移阵的特征值。我们首先调查这些结果,然后提出明确的界限上的混合时间和猜想特征值公式更一般的偏序集。我们还提出了推广到任意子集的对称群。

英文摘要:

We consider generalizations of Schuetzenberger's promotion operator on the set L of linear extensions of a finite poset. This gives rise to a strongly connected graph on L. In earlier work (arXiv:1205.7074), we studied promotion-based Markov chains on these linear extensions which generalizes results on the Tsetlin library. We used the theory of R-trivial monoids in an essential way to obtain explicitly the eigenvalues of the transition matrix in general when the poset is a rooted forest. We first survey these results and then present explicit bounds on the mixing time and conjecture eigenvalue formulas for more general posets. We also present a generalization of promotion to arbitrary subsets of the symmetric group.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑