Hitting Times in the Binomial Random Graph

ABSTRACT Fix , choose , and consider . For any pair of vertices , we give a simple and precise formula for the expected number of steps that a random walk on starting at needs to first arrive at . The formula only depends on basic structural properties of . This improves and extends recent results of Ottolini and Steinerberger, as well as Ottolini, who considered this problem for constant as well as for mildly vanishing .