You are here

 Hitting times in random graphs

Andrea Ottolin (UW)
Monday, April 8, 2024 - 2:30pm to 3:20pm
CLK 219
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.
Event Type: 
Event Subcalendar: