IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v188y2025ics0304414925001097.html
   My bibliography  Save this article

Stationary entrance chains and applications to random walks

Author

Listed:
  • Mijatović, Aleksandar
  • Vysotsky, Vladislav

Abstract

For a Markov chain Y with values in a Polish space, consider the entrance chain obtained by sampling Y at the moments when it enters a fixed set A from its complement Ac. Similarly, consider the exit chain, obtained by sampling Y at the exit times from Ac to A. We use the method of inducing from ergodic theory to study invariant measures of these two types of Markov chains in the case when the initial chain Y has a known invariant measure. We give explicit formulas for invariant measures of the entrance and exit chains under certain recurrence-type assumptions on A and Ac, which apply even for transient chains. Then we study uniqueness and ergodicity of these invariant measures assuming that Y is topologically recurrent, topologically irreducible, and weak Feller.

Suggested Citation

  • Mijatović, Aleksandar & Vysotsky, Vladislav, 2025. "Stationary entrance chains and applications to random walks," Stochastic Processes and their Applications, Elsevier, vol. 188(C).
  • Handle: RePEc:eee:spapps:v:188:y:2025:i:c:s0304414925001097
    DOI: 10.1016/j.spa.2025.104668
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414925001097
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.spa.2025.104668?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.

    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:eee:spapps:v:188:y:2025:i:c:s0304414925001097. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    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.