Hitting times in the binomial random graph

Bertille Granet, Felix Joos, Jonathan Schrodt

Fix $k\ge 2$, choose $\frac{\log n}{n^{(k-1)/k}}\le p\le 1-\Omega (\frac{{\log }^{4}n}{n})$, and consider $G\sim G(n,p)$. For any pair of vertices $v,w\in V(G)$, we give a simple and prec…