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

The paper shows that the expected meeting time of two independent continuous-time random walks on the largest component of an Erdős–Rényi graph scales linearly with the number of v…