arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1505.00734math.COmath.PR
收藏

在稀疏随机图中寻找路径需要许多查询

Finding paths in sparse random graphs requires many queries

Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira

摘要:

我们讨论了一个新的算法类型的问题,在随机图研究的最小数量的查询,一个必须问的相邻顶点对之间的随机图$G\sim {\mathcal G}(n,p)$,以找到一个子图,具有一些目标属性的概率高。本文主要研究当$p=\frac{1+\varepsilon}{n}$为固定常数$\varepsilon>0$时,在$G\sim \mathcal G(n,p)$中寻找长路径的问题.已知该随机图具有典型的线性长路径。为了在$G\sim \mathcal G(n,p)$中具有高概率的$\ell$边,显然需要查询至少$Ω\left(\frac{\ell}{p}\right)$顶点对。我们能经济地找到长度为$\ell$的路径吗,即,通过查询大概这么多对?我们认为,这是不可能的,需要查询显着更多的对。我们证明,任何随机算法,找到一个路径的长度$\ell=Ω\left(\frac{\log\left(\frac{1}{\varepsilon}\right)}{\varepsilon}\right)$与$p=\frac{1+\varepsilon}{n}$的$G\sim \mathcal G(n,p)$至少恒定的概率必须查询至少$Ω\left(\frac{\ell}{p\varepsilon \log\left(\frac{1}{\varepsilon}\right)}\right)$对顶点。这是紧到$\log\left(\frac{1}{\varepsilon}\right)$因素。

英文摘要:

We discuss a new algorithmic type of problem in random graphs studying the minimum number of queries one has to ask about adjacency between pairs of vertices of a random graph $G\sim {\mathcal G}(n,p)$ in order to find a subgraph which possesses some target property with high probability. In this paper we focus on finding long paths in $G\sim \mathcal G(n,p)$ when $p=\frac{1+\varepsilon}{n}$ for some fixed constant $\varepsilon>0$. This random graph is known to have typically linearly long paths. To have $\ell$ edges with high probability in $G\sim \mathcal G(n,p)$ one clearly needs to query at least $Ω\left(\frac{\ell}{p}\right)$ pairs of vertices. Can we find a path of length $\ell$ economically, i.e., by querying roughly that many pairs? We argue that this is not possible and one needs to query significantly more pairs. We prove that any randomised algorithm which finds a path of length $\ell=Ω\left(\frac{\log\left(\frac{1}{\varepsilon}\right)}{\varepsilon}\right)$ with at least constant probability in $G\sim \mathcal G(n,p)$ with $p=\frac{1+\varepsilon}{n}$ must query at least $Ω\left(\frac{\ell}{p\varepsilon \log\left(\frac{1}{\varepsilon}\right)}\right)$ pairs of vertices. This is tight up to the $\log\left(\frac{1}{\varepsilon}\right)$ factor.

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

↑