IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04219557.html
   My bibliography  Save this paper

Strong stationary times for finite Heisenberg walks

Author

Listed:
  • Laurent Miclo

    (TSE-R - Toulouse School of Economics - UT Capitole - Université Toulouse Capitole - UT - Université de Toulouse - EHESS - École des hautes études en sciences sociales - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement, IMT - Institut de Mathématiques de Toulouse UMR5219 - UT Capitole - Université Toulouse Capitole - UT - Université de Toulouse - INSA Toulouse - Institut National des Sciences Appliquées - Toulouse - INSA - Institut National des Sciences Appliquées - UT - Université de Toulouse - UT2J - Université Toulouse - Jean Jaurès - UT - Université de Toulouse - UT3 - Université Toulouse III - Paul Sabatier - UT - Université de Toulouse - CNRS - Centre National de la Recherche Scientifique)

Abstract

The random mapping construction of strong stationary times is applied here to finite Heisenberg random walks over ℤM, for odd M ⩾ 3. When they correspond to 3 × 3 matrices, the strong stationary times are of order M6, estimate which can be improved to M4 if we are only interested in the convergence to equilibrium of the last column. Simulations by Chhaibi suggest that the proposed strong stationary time is of the right M2 order. These results are extended to N × N matrices, with N ⩾ 3. All the obtained bounds are thought to be non-optimal, nevertheless this original approach is promising, as it relates the investigation of the previously elusive strong stationary times of such random walks to new absorbing Markov chains with a statistical physics flavor and whose quantitative study is to be pushed further. In addition, for N = 3, a strong equilibrium time is proposed in the same spirit for the non-Markovian coordinate in the upper right corner. This result would extend to separation discrepancy the corresponding fast convergence for this coordinate in total variation and open a new method for the investigation of this phenomenon in higher dimension.

Suggested Citation

  • Laurent Miclo, 2023. "Strong stationary times for finite Heisenberg walks," Post-Print hal-04219557, HAL.
    • Handle: RePEc:hal:journl:hal-04219557
    DOI: 10.1051/ps/2023008
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:hal:journl:hal-04219557. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.