arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2509.02432math.PRcs.DMmath.CO
收藏

稀疏独立同分布向量在线平衡的阈值

A threshold for online balancing of sparse i.i.d. vectors

Carnegie Mellon University(卡内基梅隆大学)

Dylan J. Altschuler, Konstantin Tikhomirov

AI总结:

针对均匀 $d$-稀疏二进制向量的在线 Beck–Fiala 平衡问题,论文证明在给定 $d$ 范围内最优在线差异度为 $\Theta(\log\log n)$,并给出匹配的高效算法及阈值。

摘要:

考虑随机到达序列 $(X_i)_{i \in [T]}$ 的在线向量平衡任务,其中时间范围满足 $T=\Theta(n)$,且 $X_i$ 是独立同分布的均匀 $d$-稀疏 $n$ 维二进制向量,$2\le d\le (\log\log n)^2/\log\log\log n$。我们证明,在此参数范围内,每个在线算法都会产生至少 $\Omega(\log\log n)$ 的差异度,同时存在一个高效算法,能以高概率达到与之匹配的 $O(\log\log n)$ 差异度界。这确立了平均情形 Beck–Fiala 问题在线版本与离线版本之间在存在性和算法层面的渐近差距。令人惊讶的是,在所考虑设定中,最优在线差异度为 $\log\log n$ 量级,与 $d$ 以及向量 $(X_i)_i$ 的范数无关。我们对 $d$ 的假设近乎最优,因为当 $d=\omega((\log\log n)^2)$ 时,这种无关性不再成立。

英文摘要:

Consider the task of \textit{online} vector balancing for stochastic arrivals $(X_i)_{i \in [T]}$, where the time horizon satisfies $T = Θ(n)$, and the $X_i$ are i.i.d uniform $d$--sparse $n$--dimensional binary vectors, with $2\leq d \le (\log\log n)^2/\log\log\log n$. We show that for this range of parameters, every online algorithm incurs discrepancy at least $Ω(\log \log n)$, and there is an efficient algorithm which achieves a matching discrepancy bound of $O(\log\log n)$ w.h.p. This establishes an asymptotic gap, both existential and algorithmic, between the online and offline versions of the average--case Beck--Fiala problem. Strikingly, the optimal online discrepancy in the considered setting is order $\log \log n$, independent of $d$ and the norms of the vectors $(X_i)_i$. Our assumptions on $d$ are nearly optimal, as this independence ceases when $d=ω((\log\log n)^2)$.

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

↑