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

在次线性时间内对边缘进行均匀采样

Sampling an Edge Uniformly in Sublinear Time

Jakub Tětek

摘要:

次线性算法领域最近受到了广泛的关注。在这种情况下,必须为输入选择特定的访问模型,因为算法没有时间进行预处理,甚至没有时间查看整个输入。一个基本的问题仍然开放的两个常见的模型之间的关系图-访问和不访问“随机边缘”查询-即是否有可能采样的边缘均匀随机模型中没有访问随机边缘查询。在本文中,我们肯定地回答了这个问题。具体来说,我们给出了一个算法解决这个问题,运行在预期的时间$O(\frac{n}{\sqrt{m}} \log n)$。这只是比[5]中给出的下限慢的对数因子。我们的算法使用了[7]中的算法,我们以更仔细的方式分析了该算法,从而在一般图中获得了更好的边界。我们还展示了一种方法来采样边缘$ε$ -接近均匀在预期的时间$O(\frac{n}{\sqrt{m}} \log \frac{1}ε)$,改进了以前已知的最好的算法。我们还注意到,从足够接近均匀的分布中采样边缘足以能够模拟使用随机边缘查询的次线性算法,同时仅将算法的成功概率降低$o(1)$。这允许一个更简单的算法,可以用来模拟随机边缘查询。

英文摘要:

The area of sublinear algorithms have recently received a lot of attention. In this setting, one has to choose specific access model for the input, as the algorithm does not have time to pre-process or even to see the whole input. A fundamental question remained open on the relationship between the two common models for graphs -- with and without access to the "random edge" query -- namely whether it is possible to sample an edge uniformly at random in the model without access to the random edge queries. In this paper, we answer this question positively. Specifically, we give an algorithm solving this problem that runs in expected time $O(\frac{n}{\sqrt{m}} \log n)$. This is only a logarithmic factor slower than the lower bound given in [5]. Our algorithm uses the algorithm from [7] which we analyze in a more careful way, leading to better bounds in general graphs. We also show a way to sample edges $ε$-close to uniform in expected time $O(\frac{n}{\sqrt{m}} \log \frac{1}ε)$, improving upon the best previously known algorithm. We also note that sampling edges from a distribution sufficiently close to uniform is sufficient to be able to simulate sublinear algorithms that use the random edge queries while decreasing the success probability of the algorithm only by $o(1)$. This allows for a much simpler algorithm that can be used to emulate random edge queries.

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

↑