arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.04977math.PR
收藏

打了就跑的顶级随机版

The hit-and-run version of top-to-random

Samuel Boardman, Daniel Rudolf, Laurent Saloff-Coste

摘要:

研究对称群$\mathbf S_n$上的{ \em hit-and-run}随机游动的一个例子.我们的出发点是众所周知的{ \em top-to-random} shuffle。在打了就跑的版本中,在每个{ \em单步骤},在$\{1,\dots,n\}$中随机均匀地挑选插入点$j$之后,将顶部卡插入到第$j$个位置$k$中,其中$k$在$\{0,1,\dots,j-1\}$中是均匀的。问题是,这是否会显著加速混合?我们表明,在$L^2$和超规范,这加速混合最多由一个常数因子(独立于$n$)。在全变差中分析这个问题是一个有趣的未决问题。

英文摘要:

We study an example of a {\em hit-and-run} random walk on the symmetric group $\mathbf S_n$. Our starting point is the well understood {\em top-to-random} shuffle. In the hit-and-run version, at each {\em single step}, after picking the point of insertion, $j$, uniformly at random in $\{1,\dots,n\}$, the top card is inserted in the $j$-th position $k$ times in a row where $k$ is uniform in $\{0,1,\dots,j-1\}$. The question is, does this accelerate mixing significantly or not? We show that, in $L^2$ and sup-norm, this accelerates mixing at most by a constant factor (independent of $n$). Analyzing this problem in total variation is an interesting open question.

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

↑