Asynchronous rumor spreading on random graphs

DOI10.1007/s00453-016-0188-xzbMath1372.68034arXiv1608.01766OpenAlexW3104481068MaRDI QIDQ2408097

L. Speidel, Konstantinos D. Panagiotou

Publication date: 9 October 2017

Published in: Algorithmica, Algorithms and Computation (Search for Journal in Brave)

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

zbMATH Keywords

random graphsgossip algorithmsasynchronous rumor spreadingpush-pull protocol

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items (10)

Effects of online and offline interaction on rumor propagation in activity-driven networks ⋮ Asynchronous rumor spreading on random graphs ⋮ On the Push&Pull Protocol for Rumor Spreading ⋮ Asymptotics for pull on the complete graph ⋮ Rumor spreading: A trigger for proliferation or fading away ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ Probabilistic Analysis of Rumor-Spreading Time ⋮ Unnamed Item ⋮ Asymptotics for push on the complete graph ⋮ Robustness of randomized rumour spreading

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
• The shortest-path problem for graphs with random arc-lengths
• Asynchronous rumor spreading on random graphs
• On the Push&Pull Protocol for Rumour Spreading
• Rumor spreading on random regular graphs and expanders
• Almost tight bounds for rumour spreading with conductance
• Asynchronous Rumor Spreading in Preferential Attachment Graphs
• Emergence of Scaling in Random Networks
• The cover time of sparse random graphs
• On Spreading a Rumor
• One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
• Randomized Rumour Spreading: The Effect of the Network Topology
• The average distances in random graphs with given expected degrees
• Proofs from THE BOOK

This page was built for publication: Asynchronous rumor spreading on random graphs