Pieter Trapman

Meeting and coalescence times for random walks in the largest component of the Erd\H{o}s-R\'enyi random graph

We prove that the stationary and worst-case expected meeting times of two independent continuous-time random walks on the largest component of the Erd\H{o}s-R\'enyi random graph $G(n,p)$ have order $n$ throughout the strictly supercritical, the slightly supercritical and the critical regimes. Using these bounds along w...