IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v199y2026ics0304414926001262.html

Uniqueness of stationary compatible probability measures for chains of infinite order with forbidden transitions

Author

Listed:
  • Gallesco, C.
  • Gallo, S.
  • Takahashi, D.Y.

Abstract

In this paper, we consider chains of infinite order on countable state spaces with prohibited transitions. We give a set of sufficient conditions on the structure of the probability kernels of the chains to have at most one stationary probability measure compatible with the kernel. Our main result extends the uniqueness ℓ2 criterion from [1] which was obtained for strongly non-null chains. A particular attention is given to concrete examples, illustrating the main theorem and its corollaries, with comparison to results of the existing literature.

Suggested Citation

  • Gallesco, C. & Gallo, S. & Takahashi, D.Y., 2026. "Uniqueness of stationary compatible probability measures for chains of infinite order with forbidden transitions," Stochastic Processes and their Applications, Elsevier, vol. 199(C).
  • Handle: RePEc:eee:spapps:v:199:y:2026:i:c:s0304414926001262
    DOI: 10.1016/j.spa.2026.104994
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414926001262
    Download Restriction: Full text may be restricted for ScienceDirect subscribers

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

    for a different version of it.

    References listed on IDEAS

    as
    1. Gallesco, Christophe & Gallo, Sandro & Takahashi, Daniel Y., 2018. "Dynamic uniqueness for stochastic chains with unbounded memory," Stochastic Processes and their Applications, Elsevier, vol. 128(2), pages 689-706.
    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.

      More about this item

      Keywords

      ;
      ;
      ;
      ;

      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:eee:spapps:v:199:y:2026:i:c:s0304414926001262. 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: 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.