On the Push&Pull Protocol for Rumour Spreading

DOI10.1145/2767386.2767416zbMath1333.68037arXiv1411.0948OpenAlexW1993079998MaRDI QIDQ2796277

Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nicholas C. Wormald

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.0948

zbMATH Keywords

randomized rumour spreadingasynchronous time modelPush\&Pull protocol

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (7)

Asynchronous rumor spreading on random graphs ⋮ Continuous-time stochastic analysis of rumor spreading with multiple operations ⋮ Probabilistic Analysis of Rumor-Spreading Time ⋮ Burning graphs: a probabilistic perspective ⋮ Rumor spreading with bounded in-degree ⋮ Discordant voting protocols for cyclically linked agents ⋮ Robustness of randomized rumour spreading

Cites Work

• Unnamed Item
• Memorization and Association on a Realistic Neural Model

This page was built for publication: On the Push&Pull Protocol for Rumour Spreading