竞赛中的倒置行走截止点及受限倒置行走的状态空间
Triangular cutoff threshold for the inversion walk on tournaments and the state space of restricted inversions
AI总结:
研究了竞赛中倒置行走的截止时间及受限倒置行走的状态空间,揭示了混合时间的临界点和状态空间的结构特性。
摘要:
给定一个标记为[n]的竞赛,将一个顶点子集X倒置意味着反转所有两个端点都在X中的边。Alon、Powierski、Savery、Scott和Wilmer(2024)询问了反复倒置一个随机子集的马尔可夫链的混合时间。我们证明这种倒置行走经历总变差截止时间n。更具体地说,存在一个通用常数C>0,使得对于所有c≥0,d_n(n+c)≤C·2^{-c},而对于所有s∈{0,1,…,n},d_n(n-s)≥1-2^{n+s log₂n - C(s)²}。特别是,下尾阈值位于n下方O(√n)处,而上尾衰减在n上方O(1)处。作为第二个结果,我们刻画了受限倒置行走的状态空间,该行走在每一步倒置一个随机k子集。对于n≥4和2≤k≤n-2,可达状态形成一个子群H_k≤F₂^{(n)²}的余数,其余数仅由k mod 4决定。
英文摘要:
Given a labelled tournament on $[n]$, \emph{inverting} a vertex subset $X$ means reversing every edge with both endpoints in $X$. Alon, Powierski, Savery, Scott, and Wilmer~\cite{AlonPowierskiSaveryScottWilmer2024} asked for the mixing time of the Markov chain that repeatedly inverts a uniformly random subset of $[n]$. We show that this \emph{inversion walk} has a triangular cutoff threshold. Let $T(s):=\binom{s+1}{2}$. For every integer sequence $s_n\in[0,n]$, $$ d_n(n-s_n)\longrightarrow \begin{cases} 1,& T(s_n)-n\to+\infty, 0,& T(s_n)-n\to-\infty. \end{cases} $$ Consequently, for every fixed $\varepsilon\in(0,1)$, $ t_{\mix}^{(n)}(\varepsilon)=n-\sqrt{2n}+O(1).$ We also prove quantitative one-sided bounds, with absolute constants $C_\star<0.36$ and $κ<3.47$, $$ d_n(n+c)\le C_\star 2^{-c}\quad(c\ge0), \qquad d_n(n-s)\ge 1-κ\,2^{\,n-\binom{s+1}{2}}\quad(0\le s\le n). $$ As a second result, we characterise the state space of the \emph{$k$-restricted inversion walk}, which inverts a uniformly random $k$-subset at each step. For $n\ge 4$ and $2\le k\le n-2$, the reachable states form a coset of a subgroup $H_k\le\F_2^{\binom{n}{2}}$ whose defining parity constraints are determined by $k\bmod 4$; equivalently, its codimension is $0,1,n-1$, or $n$ according as $k\equiv2,0,3$, or $1\pmod4$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。