arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.07618math.COcs.DM
收藏

随机谣言传播的鲁棒性

Robustness of Randomized Rumour Spreading

Rami Daknama, Konstantinos Panagiotou, Simon Reisser

摘要:

在这项工作中,我们考虑三个良好的研究广播协议:推,拉和推拉。所有这些模型的一个关键属性,也是它们受欢迎的一个重要原因,是它们被认为是非常健壮的,因为它们是简单的,随机的,并且至关重要的是,不明确地利用底层图的全局结构。虽然零星的结果存在,一直没有系统的理论治疗量化这些模型的鲁棒性。在这里,我们调查这个问题的两个正交方面:(对抗)修改的基础图形和消息传输失败。我们特别探讨了以下概念的本地弹性:从一个图开始,我们调查到的一部分的边缘的对手必须被允许删除在每个顶点,使协议需要显着更多的回合来广播的信息。我们的主要研究结果建立了三种模式之间的分离。事实证明,Pull对于我们考虑的所有参数都是鲁棒的。另一方面,Push可能会显着减慢,即使对手被允许仅通过任意小的正分数修改顶点的度。最后,Push&Pull在不考虑消息传输失败的情况下是健壮的,否则它可能会变慢。在技术方面,我们开发了两种新的方法来分析随机谣言传播协议。首先,我们利用自约束函数的概念,以促进显着的轮为基础的分析:我们表明,对于任何图形的通知顶点的增长的方差是有界的期望,使浓度的结果立即遵循。其次,为了控制图的对抗性修改,我们利用了极值图论中的一个强大工具,即Szemerèdi正则性引理。

英文摘要:

In this work we consider three well-studied broadcast protocols: Push, Pull and Push&Pull. A key property of all these models, which is also an important reason for their popularity, is that they are presumed to be very robust, since they are simple, randomized, and, crucially, do not utilize explicitly the global structure of the underlying graph. While sporadic results exist, there has been no systematic theoretical treatment quantifying the robustness of these models. Here we investigate this question with respect to two orthogonal aspects: (adversarial) modifications of the underlying graph and message transmission failures. We explore in particular the following notion of Local Resilience: beginning with a graph, we investigate up to which fraction of the edges an adversary has to be allowed to delete at each vertex, so that the protocols need significantly more rounds to broadcast the information. Our main findings establish a separation among the three models. It turns out that Pull is robust with respect to all parameters that we consider. On the other hand, Push may slow down significantly, even if the adversary is allowed to modify the degrees of the vertices by an arbitrarily small positive fraction only. Finally, Push&Pull is robust when no message transmission failures are considered, otherwise it may be slowed down. On the technical side, we develop two novel methods for the analysis of randomized rumour spreading protocols. First, we exploit the notion of self-bounding functions to facilitate significantly the round-based analysis: we show that for any graph the variance of the growth of informed vertices is bounded by its expectation, so that concentration results follow immediately. Second, in order to control adversarial modifications of the graph we make use of a powerful tool from extremal graph theory, namely Szemerèdi's Regularity Lemma.

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

↑