Meeting and coalescence times for random walks in the largest component of the Erdős-Rényi random graph

Vyacheslav Koval, Yuval Peres, Pieter Trapman

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ős-Rényi random graph $G(n,p)$…