Exact computation for meeting times and infection times of random walks on graphs

Aldous, D.: Meeting times for independent Markov chains. Stoch. Process. Appl. 38, 185–193 (1991). Aldous, D., Fill, J.: Reversible Markov chains and random walks on graphs. Monograph available at http://www.stat.berkeley.edu/~aldous/RWG/book.html (2002). Bshouty, N., Higham, L., Warpechowska-Gruca, J.: Meeting times of random walks on graphs. Inf Process Lett. 69(5), 259–265 (1999). Cooper, C., Frieze, A., Radzik, T.: Multiple random walks in random regular graphs. SIAM J Discrete Math. 22(4), 1738–1761 (2009). Coppersmith, D., Tetali, P.: Winkler: Collisions among random walks on a graph. SIAM J Discrete Math. 6(3), 363–374 (1993). Datta, N., Dorlas, T.C: Random walks on a complete graph: a model for infection. J Appl Probab. 41, 1008–1021 (2004). Draief, M., Ganesh, A.: A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents. Discrete Event Dyn Syst. 21, 41–61 (2011). Kuperman, M.: Invited review: Epidemics on social networks. Papers in Physics. 5, art. 050003 (2013). Kurkova, I., Popov, S., Vachkovskaia, M.: On infection spreading and competition between independent random walks. Electron. J. Probab. 9(11), 1–22 (2004). Kurtz, T., Lebensztayn, E., Leichsenring, A., Machado, F.: Limit theorems for an epidemic model on the complete graph. Alea. 4, 45–55 (2008). Levin, D., Peres, Y., Wilmer, E.: Markov Chains and Mixing Times. American Mathematical Society, Providence, RI (2009). Machado, F., Mashurian, H., Matzinger, H.: CLT for the proportion of infected individuals for an epidemic model on a complete graph. Markov Process. Related Fields. 17, 209–224 (2011). Markowsky, G.: Simple random walk on distance-regular graphs. preprint Arxiv:1301.6394 (2013). Pettarin, A., Pietracaprina, A., Pucci, G.: Infectious Random Walks. preprint Arxiv:1007.1604v2 (2011).