Social networks spread rumors in sublogarithmic time

With the prevalence of social networks, it has become increasingly important to understand their features and limitations. It has been observed that information spreads extremely fast in social networks. We study the performance of randomized rumor spreading protocols on graphs in the preferential attachment model. The well-known random phone call model of Karp et al. (FOCS 2000) is a push-pull strategy where in each round, each vertex chooses a random neighbor and exchanges information with it. We prove the following. - The push-pull strategy delivers a message to all nodes within Θ(log n) rounds with high probability. The best known bound so far was O(log2 n). - If we slightly modify the protocol so that contacts are chosen uniformly from all neighbors but the one contacted in the previous round, then this time reduces to Θ(log n / log log n), which is the diameter of the graph. This is the first time that a sublogarithmic broadcast time is proven for a natural setting. Also, this is the first time that avoiding double-contacts reduces the run-time to a smaller order of magnitude.

[1]  Robert Elsässer,et al.  On the communication complexity of randomized broadcasting in random-like graphs , 2006, SPAA '06.

[2]  Amin Saberi,et al.  On certain connectivity properties of the internet topology , 2006, J. Comput. Syst. Sci..

[3]  Thomas Sauerwald,et al.  Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness , 2009, ICALP.

[4]  Béla Bollobás,et al.  The Diameter of a Scale-Free Random Graph , 2004, Comb..

[5]  Alan M. Frieze,et al.  Adversarial deletion in a scale free random graph process , 2005, SODA '05.

[6]  Christos Gkantsidis,et al.  Conductance and congestion in power law graphs , 2003, SIGMETRICS '03.

[7]  Alan M. Frieze,et al.  Crawling on web graphs , 2002, STOC '02.

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

[9]  Amin Saberi,et al.  On the spread of viruses on the internet , 2005, SODA '05.

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

[11]  Alan M. Frieze,et al.  Broadcasting in Random Graphs , 1994, Discret. Appl. Math..

[12]  Jure Leskovec,et al.  Statistical properties of community structure in large social and information networks , 2008, WWW.

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

[14]  Eli Upfal,et al.  Randomized Broadcast in Networks , 1990, Random Struct. Algorithms.

[15]  Béla Bollobás,et al.  Robustness and Vulnerability of Scale-Free Random Graphs , 2004, Internet Math..

[16]  Silvio Lattanzi,et al.  Rumor spreading in social networks , 2009, Theor. Comput. Sci..

[17]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

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

[19]  Thomas Sauerwald,et al.  The power of memory in randomized broadcasting , 2008, SODA '08.

[20]  Thomas Sauerwald,et al.  On Mixing and Edge Expansion Properties in Randomized Broadcasting , 2007, Algorithmica.

[21]  Amin Saberi,et al.  On certain connectivity properties of the Internet topology , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

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

[23]  Konstantinos Panagiotou,et al.  Rumor spreading on random regular graphs and expanders , 2010, Random Struct. Algorithms.

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

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

[26]  Alan M. Frieze,et al.  The cover time of the preferential attachment graph , 2007, J. Comb. Theory, Ser. B.

[27]  Béla Bollobás,et al.  Coupling Scale-Free and Classical Random Graphs , 2004, Internet Math..