Hitting times in random graphs

I will discuss a general approach to derive nearly-exact formulas for average hitting times in large graphs. As a main example, we will consider the  case of the stochastic block model with two communities, though the idea is much more general. Time permitting, I will explain the connection with community detection.