University of Cambridge > Talks.cam > Probability > Mixing time of random walk on dynamical random cluster

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Mixing time of random walk on dynamical random cluster

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Perla Sousi.

We consider a random walk jumping on a dynamic graph (that is, the graph changes at the same time as the walker moves) given by Glauber dynamics on the random cluster model. In this model, the edges of the graph change their state, between open and closed, via a dynamics with unbounded dependences. We derive tight bounds on the mixing time when the density of open edges is small enough. For the proof, we construct a non-Markovian coupling using a multiscale analysis of the environment. This is based on joint work with Andrea Lelli.

This talk is part of the Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

CMIH Hub seminar series Polis Algebraic Geometry Seminar

Other talks

MSD lecture: Abi Doyle Detection of an unbounded thin waveguide in the Helmholtz equation in the plane. Stochastic Galerkin Approximation On computational inversion with metrics from optimal transport Bradford Hill Seminar – Tackling Bias and Inequities in Health and Genomic Data A Prompt Gamma-Ray Detection System for 3D Range Verification in Proton Beam Therapy
 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity