arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.00316cs.DSmath.CO
收藏

随机演化图中的Pull和Push&Pull

Pull and Push&Pull in Random Evolving Graphs

Rami Daknama

摘要:

Push、Pull和Push&Pull算法是研究得很好的谣言传播协议。在所有三个中,在开始时,图的一个节点被通知。在Push设置中,每一轮每个被通知的节点随机均匀地选择一个邻居,如果它还没有被通知,就通知它。在Pull设置中,每一轮每个未被通知的节点随机均匀地选择一个邻居,并向它询问谣言;如果被询问的邻居被通知,现在也通知询问节点。Push&Pull是Push和Pull的组合:在每一轮中,每个节点随机选择一个邻居。如果两人中至少有一人知道谣言,那么在这一轮之后,两人都知道谣言。Clementi等人已经考虑了Push in设置,其中底层图形在每一轮都发生变化。在他们研究的一个设置中,在每一轮中,底层图是一个新采样的Erdens-Rényi随机图$G(n,p)$。它们表明,如果$p\geq 1/n$,则概率为$1-o(1)$(作为$n\rightarrow \infty$),直到所有节点都被通知所需的轮数为$\mathcal{O}(\ln(n))$。Doerr和Kostrygin引入了一个通用的框架来分析谣言传播算法;使用这个框架,对于$a>0$和$p=a/n$,他们改进了先前在所描述的设置中的结果:Push所需的预期轮数被确定为$\log_{2-e^{-a}}(n)+1/(1-e^{-a})\ln(n)+\mathcal{O}(1)$ ;还获得了大的偏差界。使用他们的框架,我们调查拉和推拉在该设置:我们证明了拉通知所有节点所需的轮数是$\log_{2-e^{-a}}(n)+1/a \ln(n)+\mathcal{O}(1)$。设$γ:= 2(1-e^{-a})-(1-e^{-a})^2/a$ ;我们证明了Push&Pull所需的期望轮数是$\log_{1+γ}(n)+1/a\ln(n)+\mathcal{O}(1)$ ; 2作为副产品,我们也得到了大的偏差界。

英文摘要:

The Push, the Pull and the Push&Pull algorithms are well-studied rumor spreading protocols. In all three, in the beginning one node of a graph is informed. In the Push setting, every round every informed node chooses a neighbor uniformly at random and, if it is not already informed anyway, informs it. In the Pull setting, each round each uninformed node chooses a neighbor uniformly at random and asks it for the rumor; if the asked neighbor is informed, now also the asking node is informed. Push&Pull is a combination of Push and Pull: In each round, each node picks a neighbor uniformly at random. If at least one of both knows the rumor, after this round, both know the rumor. Clementi et al. have considered Push in settings where the underlying graph changes each round. In one setting they investigated, in each round the underlying graph is a newly sampled Erdős-Rényi random graph $G(n,p)$. They show that if $p\geq 1/n$ then with probability $1-o(1)$ (as $n\rightarrow \infty$) the number of rounds needed until all nodes are informed is $\mathcal{O}(\ln(n))$. Doerr and Kostrygin introduced a general framework to analyze rumor spreading algorithms; using this framework, for $a>0$ and $p=a/n$ they improved the previous results in the described setting: The expected number of rounds needed by Push was determined to be $\log_{2-e^{-a}}(n)+1/(1-e^{-a})\ln(n)+\mathcal{O}(1)$; also large deviation bounds were obtained. Using their framework, we investigate Pull and Push&Pull in that setting: We prove that the expected number of rounds needed by Pull to inform all nodes is $\log_{2-e^{-a}}(n)+1/a \ln(n)+\mathcal{O}(1)$. Let $γ:= 2(1-e^{-a})-(1-e^{-a})^2/a$; we prove that the expected number of rounds needed by Push&Pull is $\log_{1+γ}(n)+1/a\ln(n)+\mathcal{O}(1)$; as a byproduct, we obtain large deviation bounds, too.

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

↑