Rumour spreading and graph conductance

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1657-1663

  Chierichetti, Flavio ^a   Lattanzi, Silvio ^a   Panconesi, Alessandro ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED GRAPH; HIGH PROBABILITY; PUSH PULL; SPARSIFICATION;

GRAPH THEORY;

EID: 77951669910     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.135     Document Type: Conference Paper

References (23)

1. J. D. Batson, D. A. Spielman, and N. Srivastava. Twice-ramanujan sparsifiers. In Proceedings of STOC, 2009.
2. P. Berenbrink, R. Elsässer, and T. Friedetzky. Efficient randomized broadcasting in random regular networks with appliations in peer-to-peer systems. In Proceedings of PODC, 2008.
3. S. P. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip algorithms: design, analysis and applications. IEEE Transactions on Information Theory, 52, 2006.
4. J. Cheeger. A lower bound for smallest eigenvalue of laplacian. Problems in Analysis, 1970.
5. F. Chierichetti, S. Lattanzi, and A. Panconesi. Rumor spreading in social networks. In Proceedings of ICALP, 2009.
6. F. R. K. Chung. Spectral graph theory. In CBMS Regional Conference Series in Mathematics. American Mathematical Society, 1997.
7. A. J. Demers, D. H. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. E. Sturgis, D. C. Swinehart, and D. B. Terry. Epidemic algorithms for replicated database maintenance. In Proceedings of PODC, 1987.
8. B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom broadcasting. In Proceedings of SODA, 2008.
9. B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading: Expanders, push vs. pull, and robustness. In Proceedings of ICALP, 2009.
10. D. Dubhashi and A. Panconesi. Concentration of Measure for the Analysis of Randomised Algorithms. Cambridge University Press, 2009.
11. R. Elsässer. On the communication complexity of randomized broadcasting in random-like graphs. In Proceedings of SPAA, 2006.
12. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Algorithms, 1, 1990.
13. T. Friedrich and T. Sauerwald. Near-perfect load balancing by randomized rounding. In Proceedings of STOC, 2009.
14. A. Frieze and G. Grimmett. The shortest-path problem for graphs with random arc-lengths. Algorithms, 10, 1985.
15. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. In Proceedings of FOCS, 2000.
16. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proceedings of FOCS, 2003.
17. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Statistical properties of community structure in large social and information networks. In Proceedings of WWW, 2008.
18. M. Mihail, C. H. Papadimitriou, and A. Saberi. On certain connectivity properties of the internet topology. J. Comput. Syst. Sci., 72(2):239-251, 2006.
19. D. Mosk-Aoyama and D. Shah. Fast distributed algorithms for computing separable functions. Transactions on Information Theory, 54, 2008.
20. B. Pittel. On spreading a rumor. SIAM Journal on Applied Mathematics, 47, 1987.
21. T. Sauerwald. On mixing and edge expansion properties in randomized broadcasting. In Proceedings of ISAAC, 2007.
22. D. A. Spielman and N. Srivastava. Graph sparsification by effective resistances. In Proceedings of STOC, 2008.
23. D. A. Spielman and S.-H. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of STOC, 2004.