On mixing and edge expansion properties in randomized broadcasting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4835 LNCS, Issue , 2007, Pages 196-207

  Sauerwald, Thomas ^a  

^a Department of Computer Science ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; INFORMATION SYSTEMS; ITERATIVE METHODS;

EDGE EXPANSION PROPERTIES; RANDOMIZED BROADCASTING;

EDGE DETECTION;

EID: 38349066199     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77120-3_19     Document Type: Conference Paper

References (21)

1. Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized Gossip Algorithms. IEEE Transactions on Information Theory and IEEE/ACM Transactions on Networking 52(6), 2508-2530 (2006)
2. Cooper, C., Dyer, M., Greenhill, C.: Sampling regular graphs and peer-to-peer networks. In: 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 980-988 (2005)
3. Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: 6th ACM Symposium on Principles of Distributed Computing (PODC), pp. 1-12 (1987)
4. Diaconis, P.: Group Representations in Probability and Statistics. In: Lecture notes-Monograph Series, vol. 11 (1988)
5. Diaconis, P., Graham, R.L., Morrison, J.A.: Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions. Random Structures and Algorithms 1(1), 51-72 (1990)
6. Elsässer, R.: On the Communication Complexity of Randomized Broadcasting in Random-like Graphs. In: 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 148-157 (2006)
7. Elsässer, R., Sauerwald, T.: On the Runtime and Robustness of Randomized Broadcasting. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 349-358. Springer, Heidelberg (2006)
8. Elsässer, R., Sauerwald, T.: Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 163-174. Springer, Heidelberg (2007)
9. Elsässer, R., Sauerwald, T.: On the Power of Memory in Randomized Broadcasting. In: 19th ACM-SIAM Symposium on Discrete Algorithms (SODA) (to appear, 2008)
10. Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized Broadcast in Networks. Random Structures and Algorithms 1(4), 447-460 (1990)
11. Gasieniec, L., Pelc, A.: Adaptive broadcasting with faulty nodes. Parallel Computing 22, 903-912 (1996)
12. Hethcore, H.: Mathematics of infectious diseases. SIAM Review 42, 599-653 (2000)
13. Hromkovič, J., Klasing, R., Pele, A., Ružička, P., Unger, W.: Dissemination of Information in Communication Networks. Springer, Heidelberg (2005)
14. Karp, R., Schindelhauer, C., Shenker, S., Vöcking, B.: Randomized Rumor Spreading. In: 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 565-574 (2000)
15. Leighton, T., Maggs, B., Sitamaran, R.: On the fault tolerance of some popular bounded-degree networks. In: 33rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 542-552 (1992)
16. Lindsey, J.H.: Optimal Assignment of Numbers to Vertices. Amer. Math. Monthly 7, 508-516 (1964)
17. Lovász, L.: Random walks on graphs: A survey. Combinatorics, Paul Erdös is Eighty 2, 1-46 (1993)
18. Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambdrige University Press, Cambdrige (2005)
19. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
20. Pittel, B.: On spreading a rumor. SIAM Journal on Applied Mathematics 47(1), 213-223 (1987)
21. Kermack, A.M.W.O.: Contributions to the mathematical theory of epidemics. Proc. Roy. Soc., 700-721 (1927)