对称群上某些随机游动的似然阶
Likelihood Orders for some Random Walks on the Symmetric Group
摘要：
几个循环字典序被发现来描述随机游动的元素的相对似然的对称群所产生的共轭类的换位，3-循环，和n-循环。谱分析发现订单有足够的时间保持。这部分地回答了一个猜想，即n-圈是对称群上换位行走的最不可能的元素。似然序有助于理解随机游动的全变差距离和分离距离。
英文摘要：
Several cycle lexicographical orders are found to describe the relative likelihood of elements of the random walks on the symmetric group generated by the conjugacy classes of transpositions, 3-cycles, and n-cycles. Spectral analysis finds sufficient time for the orders to hold. This partially answers a conjecture that the n-cycles are the least likely elements of the transposition walk on the symmetric group. A likelihood order contributes to understanding the total variation distance and separation distance for a random walk.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
