The string of diamonds is nearly tight for rumour spreading

Comb. Probab. Comput., pp. 190-199, 2020.

Cited by: 0|Bibtex|Views11|DOI:https://doi.org/10.1017/S0963548319000385
EI
Other Links: dblp.uni-trier.de|arxiv.org|academic.microsoft.com

Abstract:

For a rumour spreading protocol, the spread time is defined as the first time that everyone learns the rumour. We compare the synchronous push&pull rumour spreading protocol with its asynchronous variant, and show that for any $n$-vertex graph and any starting vertex, the ratio between their expected spread times is bounded by $O \left(...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments