BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Investigation of a Random Walk on a Dynamical Random Graph - Sam T
 homas
DTSTART:20171108T160000Z
DTEND:20171108T170000Z
UID:TALK94807@talks.cam.ac.uk
CONTACT:Kasia Wyczesany
DESCRIPTION:We investigate properties of a simple random walk X on a dynam
 ically evolving graph \\eta. We'll work on the complete graph\, and for ea
 ch edge\, at rate 1 we resample its state: w.p. p it is open and w.p. 1-p 
 closed. We'll take p = c/n for a constant c. The graph will (typically) be
  sparse\, with 'most' vertices degree order 1. In particular\, we'll deter
 mine upper bounds on how long it takes a walk to become isolated. This wil
 l allow us to couple two full systems (X\,\\eta) and (Y\,\\xi)\, which in 
 particular gives us a bound on the mixing time of the full system. This is
  joint work with my supervisor\, Perla Sousi. 
LOCATION:MR14\, Centre for Mathematical Sciences
END:VEVENT
END:VCALENDAR