IDEAS home Printed from https://ideas.repec.org/a/spr/jotpro/v28y2015i2d10.1007_s10959-013-0497-9.html
   My bibliography  Save this article

Mixing Times are Hitting Times of Large Sets

Author

Listed:
  • Yuval Peres

    (Microsoft Research)

  • Perla Sousi

    (University of Cambridge)

Abstract

We consider irreducible reversible discrete time Markov chains on a finite state space. Mixing times and hitting times are fundamental parameters of the chain. We relate them by showing that the mixing time of the lazy chain is equivalent to the maximum over initial states $$x$$ x and large sets $$A$$ A of the hitting time of $$A$$ A starting from $$x$$ x . We also prove that the first time when averaging over two consecutive time steps is close to stationarity is equivalent to the mixing time of the lazy version of the chain.

Suggested Citation

  • Yuval Peres & Perla Sousi, 2015. "Mixing Times are Hitting Times of Large Sets," Journal of Theoretical Probability, Springer, vol. 28(2), pages 488-519, June.
    • Handle: RePEc:spr:jotpro:v:28:y:2015:i:2:d:10.1007_s10959-013-0497-9
    DOI: 10.1007/s10959-013-0497-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10959-013-0497-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10959-013-0497-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jonathan Hermon, 2020. "A Spectral Characterization for Concentration of the Cover Time," Journal of Theoretical Probability, Springer, vol. 33(4), pages 2167-2184, December.
    2. Kavita Ramanan & Aaron Smith, 2018. "Bounds on Lifting Continuous-State Markov Chains to Speed Up Mixing," Journal of Theoretical Probability, Springer, vol. 31(3), pages 1647-1678, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jotpro:v:28:y:2015:i:2:d:10.1007_s10959-013-0497-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.