Critical random graphs: Diameter and mixing time

Asaf Nachmias, Yuval Peres

Let ${\mathcal{C}}_1$ denote the largest connected component of the critical Erdős--Rényi random graph $G(n,\frac{1}{n})$. We show that, typically, the diameter of ${\mathcal{C}}_1$…