跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.26135 · v1

Tight Bounds for Distance-Unbiased Sorting

首次提交 2026-11-19 21:55
版本更新 2026-11-19 21:55
雷达观测 2026-11-20 16:53
arXiv ↗PDF ↗

摘要

We study elitist randomized local search for sorting permutations. In this model, each iteration considers a possible exchange of two positions. The entries are exchanged if and only if they are in the wrong order. We introduce \emph{distance-unbiased} selection rules, which may choose an arbitrary distribution over exchange distances but sample uniformly among all pairs at each chosen distance. For static rules, we prove that the optimal worst-case high-probability runtime is Θ(n(log⁡n)2)Θ(n(\log n)^2). This establishes the asymptotic optimality of the harmonic sorter within this class and partially resolves an open question of Olesker-Taylor. We then allow the distance distribution to change either according to a predetermined schedule or adaptively using the current permutation and the entire history. Matching upper and lower bounds show that both classes have optimal runtime Θ(n(log⁡n)2/log⁡log⁡n)Θ(n(\log n)^2/\log\log n). Thus, scheduled adjustments of the distance distribution improve the optimal static worst-case runtime by a factor of Θ(log⁡log⁡n)Θ(\log\log n), while full-information adaptation provides no further asymptotic improvement.

作者备注:Submitted to EvoCOP 2027

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-19 21:55 · 最新观测版本

Tight Bounds for Distance-Unbiased Sorting

We study elitist randomized local search for sorting permutations. In this model, each iteration considers a possible exchange of two positions. The entries are exchanged if and only if they are in the wrong order. We introduce \emph{distance-unbiased} selection rules, which may choose an arbitrary distribution over exchange distances but sample uniformly among all pairs at each chosen distance. For static rules, we prove that the optimal worst-case high-probability runtime is Θ(n(log⁡n)2)Θ(n(\log n)^2). This establishes the asymptotic optimality of the harmonic sorter within this class and partially resolves an open question of Olesker-Taylor. We then allow the distance distribution to change either according to a predetermined schedule or adaptively using the current permutation and the entire history. Matching upper and lower bounds show that both classes have optimal runtime Θ(n(log⁡n)2/log⁡log⁡n)Θ(n(\log n)^2/\log\log n). Thus, scheduled adjustments of the distance distribution improve the optimal static worst-case runtime by a factor of Θ(log⁡log⁡n)Θ(\log\log n), while full-information adaptation provides no further asymptotic improvement.

查看此版本解读 →查看此版本原文 ↗