The String of Diamonds Is Tight for Rumor Spreading

  title={The String of Diamonds Is Tight for Rumor Spreading},
  author={Omer Angel and Abbas Mehrabian and Yuval Peres},
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 ( n1/3log n ) . This improves the O( √ n) upper bound of This work started in the Random Geometric Graphs and Their Applications to Complex Networks workshop held in the… CONTINUE READING