IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i15p3388-d1209363.html
   My bibliography  Save this article

Invariant Finitely Additive Measures for General Markov Chains and the Doeblin Condition

Author

Listed:
  • Alexander Zhdanok

    (Institute for Information Transmission Problems (A.A. Kharkevich Institute) of Russian Academy of Sciences, 19/1 Bolshoy Karetny Per., 127051 Moscow, Russia)

Abstract

In this paper, we consider general Markov chains with discrete time in an arbitrary measurable (phase) space. Markov chains are given by a classical transition function that generates a pair of conjugate linear Markov operators in a Banach space of measurable bounded functions and in a Banach space of bounded finitely additive measures. We study sequences of Cesaro means of powers of Markov operators on the set of finitely additive probability measures. It is proved that the set of all limit measures (points) of such sequences in the weak topology generated by the preconjugate space is non-empty, weakly compact, and all of them are invariant for this operator. We also show that the well-known Doeblin condition ( D ) for the ergodicity of a Markov chain is equivalent to condition ( ∗ ) : all invariant finitely additive measures of the Markov chain are countably additive, i.e., there are no invariant purely finitely additive measures. We give all the proofs for the most general case.

Suggested Citation

  • Alexander Zhdanok, 2023. "Invariant Finitely Additive Measures for General Markov Chains and the Doeblin Condition," Mathematics, MDPI, vol. 11(15), pages 1-15, August.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:15:p:3388-:d:1209363
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/15/3388/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/15/3388/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Alexander Zhdanok & Anna Khuruma, 2022. "Decomposition of Finitely Additive Markov Chains in Discrete Space," Mathematics, MDPI, vol. 10(12), pages 1-21, June.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Alexander Zhdanok, 2024. "Quasi-Compactness of Operators for General Markov Chains and Finitely Additive Measures," Mathematics, MDPI, vol. 12(19), pages 1-20, October.

    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.

      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:gam:jmathe:v:11:y:2023:i:15:p:3388-:d:1209363. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.