IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2601.04900.html

Visible absorbing decompositions and uniqueness of invariant probabilities

Author

Listed:
  • Jean-Gabriel Attali

Abstract

We identify the measurable absorbing obstruction to uniqueness of invariant probability measures for a Markov kernel. Ordinary absorbing decompositions obstruct global irreducibility and recurrence, but not necessarily uniqueness: an absorbing component may have full mass for no invariant probability. We prove that a Markov kernel has more than one invariant probability if and only if it admits a visible absorbing decomposition, namely two disjoint absorbing sets, each having full mass for an invariant probability. The proof uses only the Jordan decomposition of the difference of two invariant probabilities.

Suggested Citation

  • Jean-Gabriel Attali, 2026. "Visible absorbing decompositions and uniqueness of invariant probabilities," Papers 2601.04900, arXiv.org, revised May 2026.
  • Handle: RePEc:arx:papers:2601.04900
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2601.04900
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Douc, Randal & Fort, Gersende & Guillin, Arnaud, 2009. "Subgeometric rates of convergence of f-ergodic strong Markov processes," Stochastic Processes and their Applications, Elsevier, vol. 119(3), pages 897-923, March.
    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. Kulik, Alexei & Pavlyukevich, Ilya, 2021. "Moment bounds for dissipative semimartingales with heavy jumps," Stochastic Processes and their Applications, Elsevier, vol. 141(C), pages 274-308.
    2. Ditlevsen, Susanne & Löcherbach, Eva, 2017. "Multi-class oscillating systems of interacting neurons," Stochastic Processes and their Applications, Elsevier, vol. 127(6), pages 1840-1869.
    3. Guodong Pang & Andrey Sarantsev & Yana Belopolskaya & Yuri Suhov, 2020. "Stationary distributions and convergence for M/M/1 queues in interactive random environment," Queueing Systems: Theory and Applications, Springer, vol. 94(3), pages 357-392, April.
    4. Guo, Xianping & Liao, Zhong-Wei, 2021. "Estimate the exponential convergence rate of f-ergodicity via spectral gap," Statistics & Probability Letters, Elsevier, vol. 168(C).
    5. Kulik, Alexey M., 2011. "Asymptotic and spectral properties of exponentially [phi]-ergodic Markov processes," Stochastic Processes and their Applications, Elsevier, vol. 121(5), pages 1044-1075, May.
    6. Arapostathis, Ari & Pang, Guodong, 2019. "Infinite horizon asymptotic average optimality for large-scale parallel server networks," Stochastic Processes and their Applications, Elsevier, vol. 129(1), pages 283-322.
    7. Connor, S.B. & Fort, G., 2009. "State-dependent Foster-Lyapunov criteria for subgeometric convergence of Markov chains," Stochastic Processes and their Applications, Elsevier, vol. 119(12), pages 4176-4193, December.
    8. Sarantsev, Andrey, 2021. "Sub-exponential rate of convergence to equilibrium for processes on the half-line," Statistics & Probability Letters, Elsevier, vol. 175(C).
    9. Kevei, Péter, 2018. "Ergodic properties of generalized Ornstein–Uhlenbeck processes," Stochastic Processes and their Applications, Elsevier, vol. 128(1), pages 156-181.

    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:arx:papers:2601.04900. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.