PS : Tianyi Bai (LAGA, Univ. P13) : Cover time for random walks on trees
Bâtiment Fermat, salle 2107In this talk we study the cover time, i.e. the duration to visit every site of a finite graph. In 2012, Ding et al. published an inspiring result that the asymptotics of the cover time can be estimated by the