Rumor spreading on random regular graphs and expanders

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

Volumn 6302 LNCS, Issue , 2010, Pages 560-573

  Fountoulakis, Nikolaos ^a   Panagiotou, Konstantinos ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Random Regular Graphs; Rumor Spreading

Indexed keywords

EID: 78149348430     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15369-3_42     Document Type: Conference Paper

References (27)

1. Bender, E.A., Canfield, E.R.: The asymptotic number of labelled graphs with given degree sequences. J. Combin. Theory Ser. A 24, 296-307 (1978)
2. Bollobás, B.: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Europ. J. Combin. 1, 311-316 (1980)
3. Bradonjic, M., Elsässer, R., Friedrich, T., Sauerwald, T., Stauffer, A.: Efficient broadcast on random geometric graphs. In: SODA 2010, pp. 1412-1421 (2010)
4. Chierichetti, F., Lattanzi, S., Panconesi, A.: Almost Tight Bounds for Rumour Spreading with Conductance. In: STOC 2010, pp. 399-408 (2010)
5. Chung, F.R.K., Graham, R., Wilson, R.M.: Quasi-random graphs. Combinatorica 9, 345-362 (1989)
6. 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: PODC 1987, pp. 1-12 (1987)
7. Dubhashi, D., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, Cambridge (2009)
8. Durrett, R.: Random Graph Dynamics. Cambridge University Press, New York (2007)
9. Elsässer, R.: On randomized broadcasting in power law networks. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 370-384. Springer, Heidelberg (2006)
10. Elsässer, R., Gasieniec, L., Sauerwald, T.: On radio broadcasting in random geometric graphs. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 212-226. Springer, Heidelberg (2008)
11. Elsässer, R., Sauerwald, T.: On Broadcasting vs. mixing and information dissemination on Caley graphs. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 163-174. Springer, Heidelberg (2007)
12. Elsässer, R., Sauerwald, T.: On the runtime and robustness of randomized broadcasting. Theoretical Computer Science 410, 3414-3427 (2009)
13. Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Structures and Algorithms 1(4), 447-460 (1990)
14. Fountoulakis, N., Huber, A., Panagiotou, K.: Reliable broadcasting and the effect of density. In: IEEE INFOCOM 2010, pp. TS58 (2010)
15. Fountoulakis, N., Panagiotou, K.: Rumor spreading on random regular graphs and expanders, full version, http://arxiv.org/abs/1002.3518
16. Friedman, J.: Some geometric aspects of graphs and their eigenfunctions. Duke Math. J. 69, 487-525 (1993)
17. Frieze, A.M., Grimmett, G.R.: The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math. 10, 57-77 (1985)
18. Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. AMS 43, 439-561 (2006)
19. Jagannathan, S., Pandrurangan, G., Srinivasan, S.: Query protocols for highly resilient peer-to-peer networks. In: ISCA PDCS 2006, pp. 247-252 (2006)
20. Janson, S., Łuczak, T., Ruciński, A.: Random Graphs. Wiley, Chichester (2000)
21. Krivelevich, M., Sudakov, B.: Pseudo-random graphs. In: Proceedings of the Conference on Finite and Infinite Sets. Bolyai Society Mathematical Studies, vol. 15, pp. 199-262 (2006)
22. Law, C., Siu, K.-Y.: Distributed construction of random expander networks. In: IEEE INFOCOM 2003, pp. 2133-2143 (2003)
23. McDiarmid, C.: Concentration for independent permutations. Combinatorics, Probability and Computing 11, 163-178 (2002)
24. Nilli, A.: On the second eigenvalue of a graph. Discrete Math. 91, 207-210 (1991)
25. Pandurangan, G., Raghavan, P., Upfal, E.: Building low-diameter peer-to-peer networks. IEEE Journal on Selected Areas in Communications 21, 995-1002 (2003)
26. Talagrand, M.: Concentration of measure and isoperimetric inequalities in product spaces. Inst. Hautes Études Sci. Publ. Math. 81, 73-205 (1995)
27. Thomason, A.: Pseudo-random graphs. In: Proceedings of Random Graphs, pp. 307-331 (1987)