R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, Proc. 20th IEEE Symposium on Foundations of Computer Science, FOCS, pp.218-223, 1979.

N. Alon, C. Avin, M. Koucký, G. Kozma, Z. Lotker et al., Many random walks are faster than one, Combinatorics, Probability & Computing, vol.20, issue.4, pp.481-502, 2011.

O. Angel, A. Mehrabian, and Y. Peres, The string of diamonds is tight for rumor spreading, Proc. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM, vol.26, pp.1-26, 2017.

P. Berenbrink, R. Elsässer, and T. Friedetzky, Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems, Distributed Computing, vol.29, issue.5, pp.317-339, 2016.

P. Berenbrink, G. Giakkoupis, A. Kermarrec, and F. Mallmann-trenn, Bounds on the voter model in dynamic networks, Proc. 43rd International Colloquium on Automata, Languages, and Programming, vol.146, p.15, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01353695

P. Berenbrink, G. Giakkoupis, and P. Kling, Tight bounds for coalescing-branching random walks on regular graphs, Proc. 29th ACM-SIAM Symposium on Discrete Algorithms, SODA, pp.1715-1733, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01635757

S. P. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, Randomized gossip algorithms, IEEE Trans. Information Theory, vol.52, issue.6, pp.2508-2530, 2006.

A. Z. Broder, A. R. Karlin, P. Raghavan, and E. Upfal, Trading space for time in undirected s-t connectivity, SIAM J. Comput, vol.23, issue.2, pp.324-334, 1994.

K. Censor-hillel, B. Haeupler, J. A. Kelner, and P. Maymounkov, Rumor spreading with no dependence on conductance, SIAM J. Comput, vol.46, issue.1, pp.58-79, 2017.

F. Chierichetti, G. Giakkoupis, S. Lattanzi, and A. Panconesi, Rumor spreading and conductance, J. ACM, vol.65, issue.4, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01942162

F. Chierichetti, S. Lattanzi, and A. Panconesi, Rumor spreading in social networks, Theor. Comput. Sci, vol.412, issue.24, pp.2602-2610, 2011.

C. Cooper, Random walks, interacting particles, dynamic networks: Randomness can be helpful, Proc. Structural Information and Communication Complexity -18th International Colloquium, SIROCCO, pp.1-14, 2011.

C. Cooper, A. M. Frieze, and T. Radzik, Multiple random walks in random regular graphs, SIAM J. Discrete Math, vol.23, issue.4, pp.1738-1761, 2009.

A. J. Demers, D. H. Greene, C. Hauser, W. Irish, J. Larson et al., Epidemic algorithms for replicated database maintenance, Operating Systems Review, vol.22, issue.1, pp.8-32, 1988.

T. Dimitriou, S. E. Nikoletseas, and P. G. Spirakis, The infection time of graphs, Discrete Applied Mathematics, vol.154, issue.18, pp.2577-2589, 2006.

B. Doerr, M. Fouz, and T. Friedrich, Social networks spread rumors in sublogarithmic time, Proc. 43rd ACM Symposium on Theory of Computing, STOC, pp.21-30, 2011.

B. Doerr, T. Friedrich, and T. Sauerwald, Quasirandom rumor spreading, ACM Trans. Algorithms, vol.11, issue.2, p.35, 2014.

K. Efremenko and O. Reingold, How well do random walks parallelize?, Proc. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX, and 13th International Workshop, RANDOM, pp.476-489, 2009.

R. Elsässer and T. Sauerwald, Tight bounds for the cover time of multiple random walks, Theor. Comput. Sci, vol.412, issue.24, pp.2623-2641, 2011.

U. Feige, D. Peleg, P. Raghavan, and E. Upfal, Randomized broadcast in networks, Random Struct. Algorithms, vol.1, issue.4, pp.447-460, 1990.

G. Giakkoupis, Tight bounds for rumor spreading with vertex expansion, Proc. 25th ACM-SIAM Symposium on Discrete Algorithms, SODA, pp.801-815, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01097140

G. Giakkoupis, Y. Nazari, and P. Woelfel, How asynchrony affects rumor spreading time, Proc. 35th ACM Symposium on Principles of Distributed Computing, PODC, pp.185-194, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01353698

M. Harchol-balter, F. T. Leighton, and D. Lewin, Resource discovery in distributed networks, Proc. 18th ACM Symposium on Principles of Distributed Computing, PODC, pp.229-237, 1999.

J. Hermon, Frogs on trees? Electron, J. Probab, vol.23, 2018.

V. Kanade, F. Mallmann-trenn, and T. Sauerwald, On coalescence time in graphs: When is coalescing as fast as meeting?, Proc. 30th ACM-SIAM Symposium on Discrete Algorithms, SODA, pp.956-965, 2019.

R. M. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking, Randomized rumor spreading, Proc. 41st IEEE Symposium on Foundations of Computer Science, FOCS, pp.565-574, 2000.

D. Kempe, A. Dobra, and J. Gehrke, Gossip-based computation of aggregate information, Proc. 44th IEEE Symposium on Foundations of Computer Science FOCS, pp.482-491, 2003.

H. Lam, Z. Liu, M. Mitzenmacher, X. Sun, and Y. Wang, Information dissemination via random walks in d-dimensional space, Proc. 23rd ACM-SIAM Symposium on Discrete Algorithms, SODA, pp.1612-1622, 2012.

M. Mitzenmacher, R. Rajaraman, and S. T. Roche, Better bounds for coalescingbranching random walks, TOPC, vol.5, issue.1, 2018.

D. Mosk-aoyama and D. Shah, Fast distributed algorithms for computing separable functions, IEEE Trans. Information Theory, vol.54, issue.7, pp.2997-3007, 2008.

A. Pettarin, A. Pietracaprina, G. Pucci, and E. Upfal, Infectious random walks. CoRR, 2010.

S. Y. Popov, Frogs and some other interacting random walks models, Proc. Discrete Random Walks, pp.277-288, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01183923

T. Sauerwald, On mixing and edge expansion properties in randomized broadcasting, Algorithmica, vol.56, issue.1, pp.51-88, 2010.

R. Van-renesse, Y. Minsky, and M. Hayden, A gossip-style failure detection service, Proc. IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing, Middleware '98, pp.55-70, 1998.