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

钻石串几乎是紧的谣言传播

The string of diamonds is nearly tight for rumour spreading

Omer Angel, Abbas Mehrabian, Yuval Peres

摘要:

对于谣言传播协议,传播时间被定义为每个人第一次得知谣言的时间。我们比较了同步推&拉谣言传播协议及其异步变体,并证明了对于任何$n$ -顶点图和任何起始顶点,它们的期望传播时间之间的比率有界于$O \left({n}^{1/3}{\log^{2/3} n}\right)$。这改进了Giakkoupis、Nazari和Woelfel的$O(\sqrt n)$上限(见2016年ACM分布式计算原理研讨会论文集)。我们的界紧到$O(\log n)$的因子,如钻石串图所示。我们还表明,如果一对$α,β$的实数,存在无穷多个图的两个扩展时间是$n^α$和$n^β$的期望,然后$0\leqα\leq 1$和$α\leq β\leq \frac13 + \frac23 α$,我们表明每个这样的对$α,β$是可以实现的。

英文摘要:

For a rumour spreading protocol, the spread time is defined as the first time that everyone learns the rumour. We compare the synchronous push&pull rumour spreading protocol with its asynchronous variant, and show that for any $n$-vertex graph and any starting vertex, the ratio between their expected spread times is bounded by $O \left({n}^{1/3}{\log^{2/3} n}\right)$. This improves the $O(\sqrt n)$ upper bound of Giakkoupis, Nazari, and Woelfel (in Proceedings of ACM Symposium on Principles of Distributed Computing, 2016). Our bound is tight up to a factor of $O(\log n)$, as illustrated by the string of diamonds graph. We also show that if for a pair $α,β$ of real numbers, there exists infinitely many graphs for which the two spread times are $n^α$ and $n^β$ in expectation, then $0\leqα\leq 1$ and $α\leq β\leq \frac13 + \frac23 α$; and we show each such pair $α,β$ is achievable.

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

↑