Broadcasting vs. mixing and information dissemination on Cayley graphs

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

Volumn 4393 LNCS, Issue , 2007, Pages 163-174

  Elsässer, Robert ^a   Sauerwald, Thomas ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BROADCASTING; GRAPH THEORY; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS;

CAYLEY GRAPHS; LOGARITHMIC FACTOR; RANDOM WALKS; RANDOMIZED BROADCASTING;

INFORMATION DISSEMINATION;

EID: 38049174817     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70918-3_15     Document Type: Conference Paper

References (23)

1. S. Akers, D. Harel, and B. Krishnamurthy. The star graph: An attractive alternative to the n-cube. In Proc. of ICPP'87, pages 393-400, 1987.
2. S. Akers and B. Krishnamurthy. A group-theoretic model for symmetric inter-connection networks. In Proc. of ICPP'86, pages 555-565, 1986.
3. N. Alon and J. H. Spencer. The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization, 2000.
4. I. Benjamini, N. Berger, C. Hoffmann, and E. Mossel. Mixing times of the biased card shuffling and the asymmetric exclusion process. Transactions of the American Mathematical Society, 357:3013-3029, 2005.
5. N. Biggs. Algebraic Graph Theory. Cambridge University Press, 1993.
6. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat., 23:493-507, 1952.
7. F. Chung. Spectral Graph Theory, volume 92 of CBMS Regional conference series in mathematics. American Mathematical Society, 1997.
8. F. Chung and L. Lu. Concentration inequalities and martingale inequalities - a survey. Internet Mathematics (to appear).
9. 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 Proc. of PODC'87, pages 1-12, 1987.
10. P. Diaconis. Group Representations in Probability and Statistics, volume 11. Lecture notes-Monograph Series, 1988.
11. R. Diekmann, A. Frommer, and B. Monien. Efficient schemes for nearest neighbor load balancing. Parallel Computing, 25(7):789-812, 1999.
12. R. Elsässer and T. Sauerwald. On randomized broadcasting in star graphs. In Proc. of WG'05, pages 307-318, 2005.
13. R. Elsasser and T. Sauerwald. On the runtime and robustness of randomized broadcasting. In Proc. of ISAAC06, pages 349-358, 2006.
14. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithm, I(4):447-460, 1990.
15. L. Gasieniec and A. Pelc Adaptive broadcasting with faulty nodes. Parallel Computing, 22:903-912, 1996.
16. M. Habib, C McDiarmid, J. Ramirez-Alfonsin, and B. Reed. Probabilistic Methods for Algorithmic Discrete Mathematics. Algorithms and Combinatorics, 1991.
17. T. Hagerup and C. Rub. A guided tour of chernoff bounds. Information Processing Letters, 36(6):305-308, 1990.
18. J. Hromkovič, R. Klasing, A. Pelc, P. Ruzicka, and W. Unger. Dissemination of Information in Communication Networks. Springer, 2005.
19. F. Leighton, B. Maggs, and R. Sitamaran. On the fault tolerance of some popular bounded-degree networks. In Proc. of FOCS'92, pages 542-552, 1992.
20. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988.
21. B. Pittel. On spreading rumor. SIAM Journal on Applied Mathematics, 47(1):213-223, 1987.
22. A. Sinclair and M. Jerrum. Approximate counting, uniform generation, and rapidly mixing markov chains. Inform, and Comput, 82:93-113, 1989.
23. D. Wilson. Mixing times of lozenge tiling and card shuffling markov chains. Annals of Applied Probability, 14:274-325, 2004.