arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1611.01403cs.DS
收藏

带永久噪声建议的树搜索:行走和查询算法

Searching Trees with Permanently Noisy Advice: Walking and Query Algorithms

Lucas Boczkowski, Uriel Feige, Amos Korman, Yoav Rodeh

摘要:

我们考虑一个搜索问题的树木,其目标是找到一个adversarially放置的宝藏,同时依赖于当地的,部分信息。具体地说,树中的每个节点都有一个指向其邻居之一的指针,称为\emph{advice}。节点故障的概率为$q$。非故障节点处的建议指向离宝藏更近的邻居,而故障节点处的建议指向均匀随机的邻居。重要的是,建议是{ \em permanent},在这个意义上,再次查询同一个节点将产生相同的答案。令$Δ$表示最大度。粗略地说,当考虑{ \em移动}的预期数量时,即,边缘遍历,我们表明,相变发生时,{ \em噪声参数} $q$约为$1/\sqrtΔ$。在阈值以下,存在具有预期移动复杂度$O(D\sqrtΔ)$的算法,其中$D$是宝藏的深度,而在阈值以上,每个搜索算法具有预期移动次数,其在$D$中是指数的,并且在节点数~ $n$中是多项式的。相反,如果我们要求找到宝藏的概率至少为$1-δ$,那么对于每个固定的$\varepsilon > 0$,如果$q<1/Δ^{\varepsilon}$,则存在一个搜索策略,$1-δ$使用$(δ^{-1}D)^{O(\frac 1 \varepsilon)}$移动找到宝藏的概率。此外,我们表明,$(δ^{-1}D)^{Ω(\frac 1 \varepsilon)}$移动是必要的。除了移动的次数,我们还研究了找到宝藏所需的建议{PDMATHAMO查询}的数量。粗略地说,对于这种复杂性,我们显示了与先前所述的阈值结果类似的阈值结果,其中参数$D$被$\log n$取代。

英文摘要:

We consider a search problem on trees in which the goal is to find an adversarially placed treasure, while relying on local, partial information. Specifically, each node in the tree holds a pointer to one of its neighbors, termed \emph{advice}. A node is faulty with probability $q$. The advice at a non-faulty node points to the neighbor that is closer to the treasure, and the advice at a faulty node points to a uniformly random neighbor. Crucially, the advice is {\em permanent}, in the sense that querying the same node again would yield the same answer. Let $Δ$ denote the maximal degree. Roughly speaking, when considering the expected number of {\em moves}, i.e., edge traversals, we show that a phase transition occurs when the {\em noise parameter} $q$ is about $1/\sqrtΔ$. Below the threshold, there exists an algorithm with expected move complexity $O(D\sqrtΔ)$, where $D$ is the depth of the treasure, whereas above the threshold, every search algorithm has expected number of moves which is both exponential in $D$ and polynomial in the number of nodes~$n$. In contrast, if we require to find the treasure with probability at least $1-δ$, then for every fixed $\varepsilon > 0$, if $q<1/Δ^{\varepsilon}$ then there exists a search strategy that with probability $1-δ$ finds the treasure using $(δ^{-1}D)^{O(\frac 1 \varepsilon)}$ moves. Moreover, we show that $(δ^{-1}D)^{Ω(\frac 1 \varepsilon)}$ moves are necessary. Besides the number of moves, we also study the number of advice {\em queries} required to find the treasure. Roughly speaking, for this complexity, we show similar threshold results to those previously stated, where the parameter $D$ is replaced by $\log n$.

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

↑