Asymptotics for push on the complete graph

DOI10.1016/j.spa.2021.03.008zbMath1465.05175arXiv2003.10762OpenAlexW4206527474MaRDI QIDQ5918276

Konstantinos D. Panagiotou, Simon Reisser, Rami Daknama

Publication date: 4 June 2021

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

asymptoticcomplete graphrandomized rumour spreading

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Information theory (general) (94A15)

Related Items (1)

Asymptotics for pull on the complete graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The shortest-path problem for graphs with random arc-lengths
• Asynchronous rumor spreading on random graphs
• Almost tight bounds for rumour spreading with conductance
• Randomized broadcast in networks
• Rumor Spreading on Random Regular Graphs and Expanders
• Fast Distributed Algorithms for Computing Separable Functions
• On Spreading a Rumor
• One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
• Tight Analysis of Randomized Rumor Spreading in Complete Graphs
• How Asynchrony Affects Rumor Spreading Time
• Randomized Rumour Spreading: The Effect of the Network Topology
• Tight Bounds for Rumor Spreading with Vertex Expansion
• Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks

This page was built for publication: Asymptotics for push on the complete graph