IDEAS home Printed from https://ideas.repec.org/p/tse/wpaper/129123.html
   My bibliography  Save this paper

On Markov intertwining relations and primal conditioning

Author

Listed:
  • Miclo, Laurent
  • Arnaudon, Marc
  • Coulibaly-Pasquier, Koléhè

Abstract

Given an intertwining relation between two finite Markov chains, we investigate how it can be transformed by conditioning the primal Markov chain to stay in a proper subset. A natural assumption on the underlying link kernel is put forward. The three classical examples of discrete Pitman, top-to- random shuffle and absorbed birth-and-death chain intertwinings serve as illustrations

Suggested Citation

  • Miclo, Laurent & Arnaudon, Marc & Coulibaly-Pasquier, Koléhè, 2024. "On Markov intertwining relations and primal conditioning," TSE Working Papers 24-1509, Toulouse School of Economics (TSE).
    • Handle: RePEc:tse:wpaper:129123
    as

    Download full text from publisher

    File URL: https://www.tse-fr.eu/sites/default/files/TSE/documents/doc/wp/2024/wp_tse_1509.pdf
    File Function: Full Text
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Persi Diaconis & Laurent Miclo, 2009. "On Times to Quasi-stationarity for Birth and Death Processes," Journal of Theoretical Probability, Springer, vol. 22(3), pages 558-586, September.
    2. James Allen Fill, 2009. "On Hitting Times and Fastest Strong Stationary Times for Skip-Free and More General Chains," Journal of Theoretical Probability, Springer, vol. 22(3), pages 587-600, September.
    3. James Allen Fill, 2009. "The Passage Time Distribution for a Birth-and-Death Chain: Strong Stationary Duality Gives a First Stochastic Proof," Journal of Theoretical Probability, Springer, vol. 22(3), pages 543-557, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yu Gong & Yong-Hua Mao & Chi Zhang, 2012. "Hitting Time Distributions for Denumerable Birth and Death Processes," Journal of Theoretical Probability, Springer, vol. 25(4), pages 950-980, December.
    2. James Allen Fill & Vince Lyzinski, 2014. "Hitting Times and Interlacing Eigenvalues: A Stochastic Approach Using Intertwinings," Journal of Theoretical Probability, Springer, vol. 27(3), pages 954-981, September.
    3. Marc Arnaudon & Koléhè Coulibaly-Pasquier & Laurent Miclo, 2024. "On Markov Intertwining Relations and Primal Conditioning," Journal of Theoretical Probability, Springer, vol. 37(3), pages 2425-2456, September.
    4. James Allen Fill, 2009. "On Hitting Times and Fastest Strong Stationary Times for Skip-Free and More General Chains," Journal of Theoretical Probability, Springer, vol. 22(3), pages 587-600, September.
    5. James Allen Fill & Vince Lyzinski, 2016. "Strong Stationary Duality for Diffusion Processes," Journal of Theoretical Probability, Springer, vol. 29(4), pages 1298-1338, December.
    6. James Allen Fill, 2009. "The Passage Time Distribution for a Birth-and-Death Chain: Strong Stationary Duality Gives a First Stochastic Proof," Journal of Theoretical Probability, Springer, vol. 22(3), pages 543-557, September.
    7. Laurent Miclo & Pierre Patie, 2021. "On interweaving relations," Post-Print hal-03159496, HAL.
    8. Michael C. H. Choi & Lu-Jing Huang, 2020. "On Hitting Time, Mixing Time and Geometric Interpretations of Metropolis–Hastings Reversiblizations," Journal of Theoretical Probability, Springer, vol. 33(2), pages 1144-1163, June.
    9. Yong-Hua Mao & Feng Wang & Xian-Yuan Wu, 2015. "Large Deviation Behavior for the Longest Head Run in an IID Bernoulli Sequence," Journal of Theoretical Probability, Springer, vol. 28(1), pages 259-268, March.
    10. L. Avena & A. Gaudillière, 2018. "Two Applications of Random Spanning Forests," Journal of Theoretical Probability, Springer, vol. 31(4), pages 1975-2004, December.
    11. Persi Diaconis & Laurent Miclo, 2009. "On Times to Quasi-stationarity for Birth and Death Processes," Journal of Theoretical Probability, Springer, vol. 22(3), pages 558-586, September.
    12. Erik A. Doorn, 2017. "An Orthogonal-Polynomial Approach to First-Hitting Times of Birth–Death Processes," Journal of Theoretical Probability, Springer, vol. 30(2), pages 594-607, June.
    13. Chen Jia, 2019. "Sharp Moderate Maximal Inequalities for Upward Skip-Free Markov Chains," Journal of Theoretical Probability, Springer, vol. 32(3), pages 1382-1398, September.

    More about this item

    Statistics

    Access and download statistics

    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:tse:wpaper:129123. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/tsetofr.html .

    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.