  We consider simple random walk on a realization of an Erd\H{o}s-R\'enyi graph
that is asymptotically almost surely (a.a.s.) connected. We show a Central
Limit Theorem (CLT) for the average starting hitting time, i.e. the expected
time it takes the random walker on average to first hit a vertex $j$ when
starting in a fixed vertex $i$. The average is taken with respect to $\pi_j$,
the invariant measure of the random walk.
