Tight bounds for rumor spreading in graphs of a given conductance

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 9, Issue , 2011, Pages 57-68

  Giakkoupis, George ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

Conductance; Rumor spreading

Indexed keywords

EXPANSION PROPERTIES; HIGH PROBABILITY; PUSH-PULL ALGORITHM; RUMOR SPREADING; TIGHT BOUND; UPPER BOUND;

ALGORITHMS; COMPUTER SCIENCE; ELECTRIC CONDUCTANCE;

GRAPH THEORY;

EID: 84880320717     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2011.57     Document Type: Conference Paper

References (27)

1. P. Berenbrink, R. Elsässer, and T. Friedetzky. Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. In Proc. 27th ACM Symp. on Principles of Distributed Computing (PODC), pp. 155-164, 2008.
2. B. Bollobás. The isoperimetric number of random regular graphs. Eur. J. Comb., 9(3):241-244, 1988.
3. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip algorithms: design, analysis and applications. In Proc. 24th IEEE INFOCOM, pp. 1653-1664, 2005.
4. K. Censor-Hillel and H. Shachnai. Partial information spreading with application to distributed maximum coverage. In Proc. 29th ACM Symp. on Principles of Distributed Computing (PODC), pp. 161-170, 2010.
5. F. Chierichetti, S. Lattanzi, and A. Panconesi. Rumor spreading in social networks. In Proc. 36th Intl. Colloq. on Automata, Languages and Programming (ICALP), pp. 375-386, 2009.
6. F. Chierichetti, S. Lattanzi, and A. Panconesi. Almost tight bounds for rumour spreading with conductance. In Proc. 42nd ACM Symp. on Theory of Computing (STOC), pp. 399-408, 2010.
7. F. Chierichetti, S. Lattanzi, and A. Panconesi. Rumour spreading and graph conductance. In Proc. 21st ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1657-1663, 2010.
8. 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. 6th ACM Symp. on Principles of Distributed Computing (PODC), pp. 1-12, 1987.
9. B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading. In Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 773-781, 2008.
10. B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading: Expanders, push vs. pull, and robustness. In Proc. 36th Intl. Colloq. on Automata, Languages and Programming (ICALP), pp. 366-377, 2009.
11. R. Elsässer. On the communication complexity of randomized broadcasting in random-like graphs. In Proc. 18th ACM Symp. on Parallelism In Algorithms and Architectures (SPAA), pp. 148-157, 2006.
12. R. Elsässer, U. Lorenz, and T. Sauerwald. On randomized broadcasting in star graphs. Discrete Appl. Math., 157(1):126-139, 2009.
13. R. Elsässer and T. Sauerwald. Broadcasting vs. mixing and information dissemination on Cayley graphs. In Proc. 24th Symp. on Theoretical Aspects of Computer Science (STACS), pp. 163-174, 2007.
14. R. Elsässer and T. Sauerwald. The power of memory in randomized broadcasting. In Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 218-227, 2008.
15. R. Elsässer and T. Sauerwald. On the runtime and robustness of randomized broadcasting. Theoretical Computer Science, 410(36):3414-3427, 2009.
16. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithms, 1(4):447-460, 1990.
17. N. Fountoulakis and K. Panagiotou. Rumor spreading on random regular graphs and expanders. In Proc. 14th Intl. Workshop on Randomization and Computation (RANDOM), pp. 560-573, 2010.
18. P. Fraigniaud and G. Giakkoupis. On the bit communication complexity of randomized rumor spreading. In Proc. 22nd ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 134-143, 2010.
19. A. Frieze and G. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math., 10:57-77, 1985.
20. G. Giakkoupis and P. Woelfel. On the randomness requirements of rumor spreading. To appear In Proc. 22nd ACM-SIAM Symp. on Discrete Algorithms (SODA), 2011.
21. M. Harchol-Balter, F. T. Leighton, and D. Lewin. Resource discovery in distributed networks. In Proc. 18th ACM Symp. on Principles of Distributed Computing (PODC), pp. 229-237, 1999.
22. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. In Proc. 41st IEEE Symp. on Foundations of Computer Science (FOCS), pp. 565-574, 2000.
23. D. Mosk-Aoyama and D. Shah. Computing separable functions via gossip. In Proc. 25th ACM Symp. on Principles of Distributed Computing (PODC), pp. 113-122, 2006.
24. B. Pittel. On spreading a rumor. SIAM J. Appl. Math., 47(1):213-223, 1987.
25. T. Sauerwald. On mixing and edge expansion properties in randomized broadcasting. In Proc. 18th Intl. Symp. on Algorithms and Computation (ISAAC), pp. 196-207, 2007.
26. T. Sauerwald and A. Stauffer. Rumor spreading and vertex expansion on regular graphs. To appear In Proc. 22nd ACM-SIAM Symp. on Discrete Algorithms (SODA), 2011.
27. R. van Renesse, Y. Minsky, and M. Hayden. A gossip-style failure detection service. In Proc. 15th IFIP Intl. Conf. on Distributed Systems Platforms (Middleware), pp. 55-70, 1998.