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

d维空间中基于随机游动的信息传播

Information Dissemination via Random Walks in d-Dimensional Space

Henry Lam, Zhenming Liu, Michael Mitzenmacher, Xiaorui Sun, Yajun Wang

摘要:

我们研究了一个自然的信息传播问题的多个移动代理在一个有界的欧几里得空间。在时间0,代理被均匀随机地放置在$d$ -维空间$\{-n, ..., n\}^d$中,并且其中一个代理持有一条要传播的信息。然后,所有的代理在空间上执行独立的随机游动,并且如果两个代理足够接近,则信息从一个代理传输到另一个代理。我们希望约束所有代理接收信息之前的总时间(概率很高)。我们的工作扩展了Pettarin等人。的工作(传染性随机游动,arXiv:1007. 1604 v2,2011),它为$d \leq 2$解决了这个问题。我们提出了紧边界的情况下,$d = 3$的多对数因子。(虽然我们的结果扩展到更高的维度,但出于空间和可读性的考虑,我们在这里只提供了$d=3$的情况。)我们的结果表明,当$d \geq 3$是定性不同的情况下,$d \leq 2$的行为。特别是,作为空间的体积和代理商的数量之间的比例变化,我们显示了一个有趣的相变三维,不会发生在一个或两个维度。

英文摘要:

We study a natural information dissemination problem for multiple mobile agents in a bounded Euclidean space. Agents are placed uniformly at random in the $d$-dimensional space $\{-n, ..., n\}^d$ at time zero, and one of the agents holds a piece of information to be disseminated. All the agents then perform independent random walks over the space, and the information is transmitted from one agent to another if the two agents are sufficiently close. We wish to bound the total time before all agents receive the information (with high probability). Our work extends Pettarin et al.'s work (Infectious random walks, arXiv:1007.1604v2, 2011), which solved the problem for $d \leq 2$. We present tight bounds up to polylogarithmic factors for the case $d = 3$. (While our results extend to higher dimensions, for space and readability considerations we provide only the case $d=3$ here.) Our results show the behavior when $d \geq 3$ is qualitatively different from the case $d \leq 2$. In particular, as the ratio between the volume of the space and the number of agents varies, we show an interesting phase transition for three dimensions that does not occur in one or two dimensions.

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

↑