On broadcasting time in the model of travelling agents

DOI10.1016/J.DAM.2020.12.022OpenAlexW3114146250MaRDI QIDQ2659076

Paweł Prałat, Przemysław Szufel, Reaz Huq, Atefeh Mashatan, Bogumił Kamiński

Publication date: 25 March 2021

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

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

zbMATH Keywords

random walkbroadcastingtalkative particles

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx) Mathematical sociology (including anthropology) (91Dxx) Combinatorial probability (60Cxx)

Related Items (1)

Broadcasting on paths and cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mean field conditions for coalescing random walks
• Connection times in large ad-hoc mobile networks
• The shortest-path problem for graphs with random arc-lengths
• Tail bounds for sums of geometric and exponential variables
• Multiple Random Walks in Random Regular Graphs
• On Spreading a Rumor
• Tight Analysis of Randomized Rumor Spreading in Complete Graphs
• On the Push&Pull Protocol for Rumor Spreading
• On the coalescence time of reversible random walks
• Asymptotics for push on the complete graph

This page was built for publication: On broadcasting time in the model of travelling agents