BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Mixing times are hitting times of large sets - Perla Sousi (Cambri
 dge)
DTSTART:20111018T153000Z
DTEND:20111018T163000Z
UID:TALK33569@talks.cam.ac.uk
CONTACT:HoD Secretary\, DPMMS
DESCRIPTION:We consider irreducible reversible discrete time Markov chains
  on a finite\nstate space. Mixing times and hitting times are fundamental 
 parameters of\nthe chain. In this talk\, we relate them by showing that th
 e mixing time of\nthe lazy chain is equivalent to the maximum over initial
  states x and large\nsets A of the hitting time of A starting from x. As a
 n application\, we show\nthat the mixing time on a finite binary tree is r
 obust to bounded change of\nedge conductances. (Joint work with Yuval Pere
 s)
LOCATION:MR12\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR