University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Mixing time of random walk on dynamical random cluster

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

Mixing time of random walk on dynamical random cluster

Download to your calendar using vCal

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

SSDW01 - Self-interacting processes

We consider a random walk jumping on a dynamic graph; that is, a graph that changes at the same time as the walker moves. Previous works considered the case where the graph changes via dynamical percolation, in which the edges of the graph switch between two states, open and closed, and the walker is only allowed to cross open edges. In dynamical percolation, edges change their state independently of one another.In this work, we consider a graph dynamics with unbounded dependences: Glauber dynamics on the random cluster model.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 Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge University Engineering Department LR6 William Mong Hall, Sidney Sussex College, Cambridge CB2 3HU Goldsmiths 1, Lecture Theatre, Department of Materials Science & Metallurgy

Other talks

Spectral theory for Dirac operators with singular potentials Director's Briefing Title to be confirmed TBC Caribbean Trip and Cacti Dwarf Galaxies in the Local Universe
 

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