Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks

DOI10.1145/3382734.3405720MaRDI QIDQ5855244zbMATH OpenOpenAlexFDO

Authors Ali Pourmiri, Bernard Mans

Publication date 15 March 2021

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

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

zbMATH Keywords

asynchronous modelspush/pullrandomized rumor spreading

Mathematics Subject Classification ID

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

Cited in

(5)

• Asymptotics for pull on the complete graph
• Asynchronous Rumor Spreading in Preferential Attachment Graphs
• On the Push&Pull Protocol for Rumor Spreading
• Asymptotics for push on the complete graph
• Rumors with changing credibility

This page was built for publication: Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks

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