Rurnor spreading and vertex expansion on regular graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 462-475

  Sauerwald, Thomas ^a   Stauffer, Alexandre ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COVER TIME; NON-REGULAR GRAPH; RANDOM WALK; REGULAR GRAPHS; RUMOR SPREADING; RUNTIMES; UPPER BOUND; VERTEX GRAPHS;

ALGORITHMS; EXPANSION; GRAPHIC METHODS;

GRAPH THEORY;

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

References (32)

1. N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83-96, 1986.
2. N. Alon, I. Benjainini, and A. Stacey. Percolation on finite graphs and isoperimetric inequalities. The Annals of Probability, 32(3):1727-1745, 2004. (Pubitemid 39258790)
3. L. Babai. Local expansion of vertex-transitive graphs and random generation in finite groups. In 23rd STOC, pages 164-174, 1991.
4. A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler. The effect of faults on network expansion. Theory of Computing Systems, 39(6):903- 928, 2006. (Pubitemid 44878431)
5. P. Berenbrink, R. Elsässer, and T. Friedetzky. Efficient randomized broadcasting in random regular networks with applications in peer-to-peer systems. In 27th PODC, pages 155-164, 2008.
6. B. Bollobás. Random Graphs. Cambridge University Press, Cambridge, UK, second edition, 2001.
7. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized Gossip Algorithms. IEEE Transactions on Information Theory and IEEE/ACM Transactions on Networking, 52(6):2508-2530, 2006. (Pubitemid 43898906)
8. A.K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, and P. Tiwari. The Electrical Resistance of a Graph Captures its Commute and Cover Times. Computational Complexity, 6(4):312-340, 1997. (Pubitemid 128060674)
9. F. Chierichetti, S. Lattanzi. and A. Panconesi. Rumor spreading in social networks. In 36th ICALP, pages 375-386, 2009.
10. F. Chierichetti, S. Lattanzi, and A. Panconesi. Almost tight bounds on rumour spreading by conductance. In 41st STOC, pages 399-408, 2010.
11. F. Chierichetti, S. Lattanzi, and A. Panconesi. Rumour spreading and graph conductance. In 21th SODA, pages 1657-1663, 2010.
12. A. Czumaj and C. Sohler. Testing expansion in bounded-degree graphs. In 48th FOCS, pages 570-578, 2007.
13. 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 PODC, pages 1-12, 1987.
14. B. Doerr, T. Friedrich, and T. Sauerwald. Quasiran- dom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. In 36th ICALP, pages 366-377, 2009.
15. R. Elsässer and T. Sauerwald. Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs. In 24th STACS, pages 163-174, 2007.
16. R. Elsässer and T. Sauerwald. Cover Time and Broadcast Time. In 26th STACS, pages 373-384, 2009.
17. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized Broadcast in Networks. Random Structures and Algorithms, 1(4):447-460, 1990.
18. N. Fountoulakis, A. Huber, and K. Panagiotou. Reliable broadcasting in random networks and the effect of density. In 29th IEEE Conference on Computer Communications (INFOCOM'10), pages 2552-2560, 2010.
19. C. GowriShankaran. Broadcasting on recursively decomposable Cayley graphs. Discrete Applied Mathematics, 53(1-3):171-182, 1994.
20. G. Grimmett. Percolation. Springer-Verlag, second edition, 1999.
21. S.M. Hedetniemi, S. T. Hedetniemi, and A. L. Liest-man. A survey of gossiping and broadcasting in communication networks. Networks, 18(4):319-349, 1988.
22. J. Hromkovič, R. Klasing, A. Pele, P. Ružička, and W. Unger. Dissemination of Information in Communication Networks. Springer, 2004.
23. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized Rumor Spreading. In 44rd FOCS, pages 565-574, 2000. (Pubitemid 32075925)
24. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In 44rd FOCS, pages 482-491, 2003.
25. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988.
26. D. Mosk-Aoyama and D. Shah. Fast distributed algorithms for computing separable functions. IEEE Transactions on Information Theory, 54(7):2997-3007.
27. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
28. B. Pittel. On spreading a rumor. SIAM Journal on Applied Mathematics, 47(1):213-223, 1987.
29. T. Sauerwald. On Mixing and Edge Expansion Properties in Randomized Broadcasting. Algorithmica, 56(1):51-88, 2010.
30. J. Sheu, C. Wu, and T. Chen. An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs. IEEE Transactions on Parallel and Distributed Systems, 6(6):653-658, 1996.
31. A. Sinclair. Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow. Combinatorics, Probability & Computing, 1:351-370, 1992.
32. D. Spielman and N. Srivastava. Graph sparsification by effective resistances. In 40th STOC, pages 563-568, 2008.