Broadcasting on paths and cycles

DOI10.1016/j.disc.2022.112883OpenAlexW3108030130MaRDI QIDQ2138979

Paweł Prałat, Reaz Huq

Publication date: 17 May 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random walksbroadcastingtalkative particles

Mathematics Subject Classification ID

Graph theory (05Cxx) Markov processes (60Jxx) Special processes (60Kxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mean field conditions for coalescing random walks
• The shortest-path problem for graphs with random arc-lengths
• On an epidemic model on finite graphs
• The spread of a rumor or infection in a moving population
• On broadcasting time in the model of travelling agents
• Multiple Random Walks in Random Regular Graphs
• How Well Do Random Walks Parallelize?
• On Spreading a Rumor
• How to Spread a Rumor
• Tight Analysis of Randomized Rumor Spreading in Complete Graphs
• Many Random Walks Are Faster Than One
• On the Push&Pull Protocol for Rumor Spreading
• On the coalescence time of reversible random walks
• Asymptotics for push on the complete graph