Asynchronous Rumor Spreading on Random Graphs

We perform a thorough study of various characteristics of the asynchronous push-pull protocol for spreading a rumor on Erdős-Renyi random graphs G n,p , for any p > cln (n)/n, c > 1. In particular, we prove tight bounds for the total time that is needed until the information has spread to all nodes. Moreover, we quantify precisely the robustness of the protocol with respect to transmission and node failures.

[1]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[2]  Anne-Marie Kermarrec,et al.  Gossip-based peer sampling , 2007, TOCS.

[3]  B. Pittel.  On spreading a rumor , 1987 .

[4]  Colin Cooper,et al.  The cover time of sparse random graphs , 2007 .

[5]  Robbert van Renesse,et al.  A Gossip-Style Failure Detection Service , 2009 .

[6]  Thomas Sauerwald,et al.  Ultra-fast rumor spreading in social networks , 2012, SODA.

[7]  P. Massart,et al.  Concentration inequalities and model selection , 2007 .

[8]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[9]  Konstantinos Panagiotou,et al.  Reliable Broadcasting in Random Networks and the Effect of Density , 2010, 2010 Proceedings IEEE INFOCOM.

[10]  Silvio Lattanzi,et al.  Almost tight bounds for rumour spreading with conductance , 2010, STOC '10.

[11]  Mahmoud Fouz,et al.  Social Networks Spread Rumors in Sublogarithmic Time , 2011, Electron. Notes Discret. Math..

[12]  Silvio Lattanzi,et al.  Rumour spreading and graph conductance , 2010, SODA '10.

[13]  Mahmoud Fouz,et al.  Asynchronous Rumor Spreading in Preferential Attachment Graphs , 2012, SWAT.

[14]  Alan M. Frieze,et al.  The shortest-path problem for graphs with random arc-lengths , 1985, Discret. Appl. Math..

[15]  Richard M. Karp,et al.  Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[16]  Achim Klenke,et al.  Probability theory - a comprehensive course , 2008, Universitext.

[17]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[18]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[19]  Fan Chung Graham,et al.  The Average Distance in a Random Graph with Given Expected Degrees , 2004, Internet Math..

[20]  George Giakkoupis,et al.  Tight bounds for rumor spreading in graphs of a given conductance , 2011, STACS.