How to Spread a Rumor

DOI10.1145/3293611.3331622MaRDI QIDQ5145175zbMATH OpenOpenAlexFDO

Authors George Giakkoupis, Frederik Mallmann-Trenn, Hayk Saribekyan

Publication date 20 January 2021

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

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

zbMATH Keywords

random walksinformation disseminationrumor spreading

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• On the Push\&Pull protocol for rumour spreading (extended abstract)
• On the Push&Pull Protocol for Rumor Spreading
• Faster rumor spreading with multiple calls
• Asymptotically optimal randomized rumor spreading
• Faster rumor spreading with multiple calls

Cited in

(6)

• How to Spread Rumors Fast
• Spread of information and diseases via random walks in sparse graphs
• Broadcasting on paths and cycles
• Stochastic strategies for patrolling a terrain with a synchronized multi-robot system
• How does rumor spreading affect people inside and outside an institution
• How to discreetly spread a rumor in a crowd

This page was built for publication: How to Spread a Rumor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145175)