arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.10762math.PRmath.CO
收藏

完全图上推的渐近性

Asymptotics for Push on the Complete Graph

Rami Daknama, Konstantinos Panagiotou, Simon Reisser

摘要:

我们研究流行的随机谣言传播协议推。最初,图中的节点拥有一些信息,然后以基于轮的方式传播。在每一轮中,每个被通知的节点均匀地随机选择一个它的邻居,并将信息传递给它。要调查的中心量是循环数,即每个节点都收到信息之前所需的循环数。Push协议及其变体已经被广泛研究。在这里,我们研究的情况下,底层图是完整的$n$节点。即使在这个最基本的设置中,指定运行时的限制分布以及确定相关的量,如其期望值,自协议引入以来仍然存在开放问题。在我们的主要结果中,我们描述了运行时的限制分布。我们发现,它不收敛,它成为适当的规范化后,渐近周期的$\log_2n$以及$\ln n$规模。特别是,极限分布收敛,只有当我们限制自己的$\mathbb N$,其中同时$\log_2 n-\lfloor\log_2n\rfloor\to x$和$\ln n-\lfloor\ln n\rfloor\to y$为一些固定的$x,y\in [0,1)$适当的连续性。在这种情况下,我们表明,预期的运行时间是$\log_2 n+\ln n+h(x,y)+o(1)$,其中$h$明确给出和数字$|\sup h - \inf h| \approx 2\cdot 10^{-4}$。

英文摘要:

We study the popular randomized rumour spreading protocol Push. Initially, a node in a graph possesses some information, which is then spread in a round based manner. In each round, each informed node chooses uniformly at random one of its neighbours and passes the information to it. The central quantity to investigate is the Runtime, that is, the number of rounds needed until every node has received the information. The Push protocol and variations of it have been studied extensively. Here we study the case where the underlying graph is complete with $n$ nodes. Even in this most basic setting, specifying the limiting distribution of the runtime as well as determining related quantities, like its expectation, have remained open problems since the protocol was introduced. In our main result we describe the limiting distribution of the runtime. We show that it does not converge, and that it becomes, after the appropriate normalization, asymptotically periodic both on the $\log_2n$ as well as on the $\ln n$ scale. In particular, the limiting distribution converges only if we restrict ourselves to suitable subsequences of $\mathbb N$, where simultaneously $\log_2 n-\lfloor\log_2n\rfloor\to x$ and $\ln n-\lfloor\ln n\rfloor\to y$ for some fixed $x,y\in [0,1)$. On such subsequences we show that the expected runtime is $\log_2 n+\ln n+h(x,y)+o(1)$, where $h$ is explicitly given and numerically $|\sup h - \inf h| \approx 2\cdot 10^{-4}$.

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

↑