Randomized rumor spreading revisited

DOI10.4230/LIPICS.ICALP.2017.138MaRDI QIDQ5111471zbMATH OpenFDO

Authors Benjamin Doerr, Anatolii Kostrygin

Publication date 27 May 2020

zbMATH Keywords

rumor spreadingdynamic graphepidemic algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network protocols (68M12)

Recommendations

• Faster rumor spreading with multiple calls
• Faster rumor spreading with multiple calls
• Tight analysis of randomized rumor spreading in complete graphs
• Asymptotically optimal randomized rumor spreading
• scientific article; zbMATH DE number 6783407

Cited in

(19)

• On the Push&Pull Protocol for Rumor Spreading
• Sharp Thresholds in Random Simple Temporal Graphs
• Finding rumor sources on random trees
• Tight analysis of randomized rumor spreading in complete graphs
• Faster rumor spreading with multiple calls
• Rumor spreading models with random denials
• Quasirandom Rumor Spreading: An Experimental Analysis
• Rumor spreading in random evolving graphs
• Continuous-time stochastic analysis of rumor spreading with multiple operations
• Asymptotically optimal randomized rumor spreading
• Asymptotics for push on the complete graph
• Stochastic analysis of rumor spreading with multiple pull operations
• scientific article; zbMATH DE number 6783407 (Why is no real title available?)
• Randomized Rumor Spreading in Dynamic Graphs
• Randomized Rumor Spreading Revisited (Long Version)
• Faster rumor spreading with multiple calls
• Robustness of randomized rumour spreading
• Asymptotics for pull on the complete graph
• scientific article; zbMATH DE number 7525473 (Why is no real title available?)

This page was built for publication: Randomized rumor spreading revisited

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