Introducing Quasirandomness to Computer Science

The paradigm of quasirandomness led to dramatic progress in different areas of mathematics, with the invention of quasi-Monte Carlo methods in numerical integration probably being the best known example. In the last two decades, discrete mathematics heavily used quasirandom ideas, leading, e.g., to notions like quasirandom graphs. We feel that it is now time to exploit quasirandomness in computer science. As a first application, we propose and analyze a quasirandom analogue of the classical randomized rumor spreading protocol to disseminate information in networks.

[1]  E. Novak,et al.  The inverse of the star-discrepancy depends linearly on the dimension , 2001 .

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

[3]  Omer Reingold,et al.  Undirected ST-connectivity in log-space , 2005, STOC '05.

[4]  Thomas Sauerwald,et al.  On the runtime and robustness of randomized broadcasting , 2006, Theor. Comput. Sci..

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

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

[7]  Konstantinos Panagiotou,et al.  Tight Bounds for Quasirandom Rumor Spreading , 2009, Electron. J. Comb..

[8]  P. Erdös,et al.  Graph Theory and Probability , 1959 .

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

[10]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[11]  Thomas Sauerwald,et al.  Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs , 2007, STACS.

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

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

[14]  Thomas Sauerwald,et al.  Quasirandom rumor spreading: An experimental analysis , 2008, JEAL.

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

[16]  Benjamin Doerr,et al.  Quasirandom rumor spreading , 2008, SODA 2008.

[17]  H. Robbins.  A Remark on Stirling’s Formula , 1955 .

[18]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[19]  Noga Alon,et al.  The Probabilistic Method, Second Edition , 2004 .

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

[21]  Doug Terry,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[22]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..