COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Cambridge Analysts' Knowledge Exchange > Investigation of a Random Walk on a Dynamical Random Graph

## Investigation of a Random Walk on a Dynamical Random GraphAdd to your list(s) Download to your calendar using vCal - Sam Thomas
- Wednesday 08 November 2017, 16:00-17:00
- MR14, Centre for Mathematical Sciences.
If you have a question about this talk, please contact Kasia Wyczesany. We investigate properties of a simple random walk X on a dynamically evolving graph \eta. We’ll work on the complete graph, and for each 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 determine upper bounds on how long it takes a walk to become isolated. This will 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. This talk is part of the Cambridge Analysts' Knowledge Exchange series. ## This talk is included in these lists:- All CMS events
- CMS Events
- Cambridge Analysts' Knowledge Exchange
- DAMTP info aggregator
- MR14, Centre for Mathematical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsSocial Mobility: Chavs, NEETs and McJobs LMS Invited Lectures 2011 Cambridge Interdisciplinary Reproduction Forum## Other talksPart IIB Poster Presentations Volcanoes and Explosions Production Processes Group Seminar - "Advanced water filtration platforms based on hierarchically structured carbon nanotubes." Architecture and the English economy, 1200-1500: a new history of the parish church over the longue durée St Catharine’s Political Economy Seminar - ‘Global Imbalances and Greece's Exit from the Crisis’ by Dimitrios Tsomocos |