Randomized rumor spreading revisited

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

Authors Benjamin Doerr, Anatolii Kostrygin

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2017.138

zbMATH Keywords

dynamic graphepidemic algorithmrumor spreading

Mathematics Subject Classification ID

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

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

(21)

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

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)