University of Cambridge > Talks.cam > Probability > Mixing times are hitting times of large sets

  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 times are hitting times of large sets

Download to your calendar using vCal

If you have a question about this talk, please contact HoD Secretary, DPMMS .

We consider irreducible reversible discrete time Markov chains on a finite state space. Mixing times and hitting times are fundamental parameters of the chain. In this talk, we relate them by showing that the mixing time of the lazy chain is equivalent to the maximum over initial states x and large sets A of the hitting time of A starting from x. As an application, we show that the mixing time on a finite binary tree is robust to bounded change of edge conductances. (Joint work with Yuval Peres)

This talk is part of the Probability series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Life Sciences and Society Seminars Homerton College, Mary Allan Building, Bouling 8 & 9, Hills Road, Cambridge, CB2 8PQ Average on weekdays: 9038.31155015 kWh

Other talks

Group Presentation 5 "Green" RSEs? A new role (and a new community) to reduce the environmental impact of research Semiconductor-based neutron detector development at QMUL Group Work Title to be confirmed Afternoon Break
 

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