Quasirandom rumor spreading

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 773-781

  Doerr, Benjamin ^a   Friedrich, Tobias ^a   Sauerwald, Thomas ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION DISSEMINATION;

HYPER CUBES; QUASI-RANDOM; RANDOM GRAPHS; SIMPLE PROTOCOL;

GRAPH THEORY;

EID: 58449090977     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. B. Bollobás and Y. Kohayakawa. On Richardson's model on the hypercube. In B. Bollobás and A. Thomason, editors, Combinatorics, Geometry and Probability, pages 129-137. Cambridge University Press, 1997.
2. C. Cooper and A. Frieze. The cover time of sparse random graphs. In 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 140-147, 2003.
3. C. Cooper, M. Dyer, and C. Greenhill. Sampling regular graphs and peer-to-peer networks. In 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 980-988, 2005.
4. J. Cooper and J. Spencer. Simulating a random walk with constant error. Comb. Probab. Comput., 15:815-822, 2006.
5. J. Cooper, B. Doerr, J. Spencer, and G. Tardos. Deterministic random walks on the integers. European Journal of Combinatorics. To appear, preliminary version available from arXiv:math/0602300.
6. J. Cooper, B. Doerr, T. Friedrich, and J. Spencer. Deterministic random walks on regular trees. In 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 766-772, 2008.
7. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In 6th ACM Symposium on Principles of Distributed Computing (PODC), pages 1-12, 1987.
8. B. Doerr and T. Friedrich. Deterministic random walks on the two-dimensional grid. Available from arXiv:math/0703453.
9. R. Elsässer. On the Communication Complexity of Randomized Broadcasting in Random-like Graphs. In 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 148-157, 2006.
10. R. Elsässer and T. Sauerwald. Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs. In 24th International Symposium on Theoretical Aspects of Computer Science (STACS), pages 163-174, 2007.
11. R. Elsässer and T. Sauerwald. On the Power of Memory in Randomized Broadcasting. In 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 218-227, 2008.
12. P. Erdös and A. Rényi. On random graphs. Publ. Math. Debrecen, 6:290-297, 1959.
13. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithm, 1(4):447-460, 1990.
14. J. Fill and R. Pemantle. Percolation, first-passage percolation and covering times for richardson's model on the n-cube. Annals of Applied Probability, 3:593-629, 1993.
15. A. Frieze and G. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics, 10:57-77, 1985.
16. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized Rumor Spreading. In 41 st IEEE Symposium on Foundations of Computer Science (FOCS), pages 565-574, 2000.
17. C. McDiarmid. On the method of bounded differences. In Surveys in combinatorics, 1989 (Norwich, 1989), volume 141 of London Math. Soc. Lecture Note Ser., pages 148-188. Cambridge Univ. Press, Cambridge, 1989.
18. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
19. H. Niederreiter. Random number generation and quasi-Monte Carlo methods, volume 63 of CBMS- NSF Regional Conference Series in Applied Mathematics. SIAM, Philadelphia, PA, 1992.
20. B. Pittel. On spreading a rumor. SIAM Journal on Applied Mathematics, 47(1):213-223, 1987.
21. V. B. Priezzhev, D. Dhar, A. Dhar, and S. Krishnamurthy. Eulerian walkers as a model of selforganized criticality. Phys. Rev. Lett., 77:5079-5082, 1996.