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

Augmented truncation approximations to the solution of Poisson’s equation for Markov chains

Author

Listed:
  • Liu, Jinpeng
  • Liu, Yuanyuan
  • Zhao, Yiqiang Q.

Abstract

Poisson’s equation has a lot of applications in various areas, such as Markov decision theory, perturbation theory, central limit theorems (CLTs), etc. Usually it is hard to derive the explicit expression of the solution of Poisson’s equation for a Markov chain on an infinitely many state space. Here we will present a computational framework for the solution for both discrete-time Markov chains (DTMCs) and continuous-time Markov chains (CTMCs), by developing the technique of augmented truncation approximations. The censored Markov chain and the linear augmentation to some columns are shown to be effective truncation approximation schemes. Moreover, the convergence to the variance constant in CLTs are also considered. Finally the results obtained are applied to discrete-time single-birth processes and continuous-time single-death processes.

Suggested Citation

  • Liu, Jinpeng & Liu, Yuanyuan & Zhao, Yiqiang Q., 2022. "Augmented truncation approximations to the solution of Poisson’s equation for Markov chains," Applied Mathematics and Computation, Elsevier, vol. 414(C).
  • Handle: RePEc:eee:apmaco:v:414:y:2022:i:c:s0096300321006949
    DOI: 10.1016/j.amc.2021.126610
    as

    Download full text from publisher

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

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

    References listed on IDEAS

    as
    1. Glynn, Peter W. & Ormoneit, Dirk, 2002. "Hoeffding's inequality for uniformly ergodic Markov chains," Statistics & Probability Letters, Elsevier, vol. 56(2), pages 143-146, January.
    2. Glynn, Peter W. & Whitt, Ward, 2002. "Necessary conditions in limit theorems for cumulative processes," Stochastic Processes and their Applications, Elsevier, vol. 98(2), pages 199-209, April.
    3. Gibson, Diana & Seneta, E., 1987. "Monotone infinite stochastic matrices and their augmented truncations," Stochastic Processes and their Applications, Elsevier, vol. 24(2), pages 287-292, May.
    4. Jiang, Shuxia & Liu, Yuanyuan & Yao, Shuai, 2014. "Poisson’s equation for discrete-time single-birth processes," Statistics & Probability Letters, Elsevier, vol. 85(C), pages 78-83.
    5. Choi, Michael C.H. & Li, Evelyn, 2019. "A Hoeffding’s inequality for uniformly ergodic diffusion process," Statistics & Probability Letters, Elsevier, vol. 150(C), pages 23-28.
    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. Sandrić, Nikola & Šebek, Stjepan, 2023. "Hoeffding’s inequality for non-irreducible Markov models," Statistics & Probability Letters, Elsevier, vol. 200(C).
    2. H. S. Chang, 2004. "Technical Note: On Ordinal Comparison of Policies in Markov Reward Processes," Journal of Optimization Theory and Applications, Springer, vol. 122(1), pages 207-217, July.
    3. Yongqiang Tang, 2007. "A Hoeffding-Type Inequality for Ergodic Time Series," Journal of Theoretical Probability, Springer, vol. 20(2), pages 167-176, June.
    4. Braunsteins, Peter & Decrouez, Geoffrey & Hautphenne, Sophie, 2019. "A pathwise approach to the extinction of branching processes with countably many types," Stochastic Processes and their Applications, Elsevier, vol. 129(3), pages 713-739.
    5. Ahmad, I.A. & Amezziane, M., 2013. "Probability inequalities for bounded random vectors," Statistics & Probability Letters, Elsevier, vol. 83(4), pages 1136-1142.
    6. Penev, Spiridon & Peng, Hanxiang & Schick, Anton & Wefelmeyer, Wolfgang, 2004. "Efficient estimators for functionals of Markov chains with parametric marginals," Statistics & Probability Letters, Elsevier, vol. 66(3), pages 335-345, February.
    7. Cruz, Juan Alberto Rojas, 2020. "Sensitivity of the stationary distributions of denumerable Markov chains," Statistics & Probability Letters, Elsevier, vol. 166(C).
    8. Badredine Issaadi, 2020. "Weak stability bounds for approximations of invariant measures with applications to queueing," Methodology and Computing in Applied Probability, Springer, vol. 22(1), pages 371-400, March.
    9. Daly, Fraser, 2024. "On Stein’s method for stochastically monotone single-birth chains," Statistics & Probability Letters, Elsevier, vol. 206(C).
    10. Shie Mannor & John N. Tsitsiklis, 2005. "On the Empirical State-Action Frequencies in Markov Decision Processes Under General Policies," Mathematics of Operations Research, INFORMS, vol. 30(3), pages 545-561, August.
    11. Hunt, F.Y., 2005. "Sample path optimality for a Markov optimization problem," Stochastic Processes and their Applications, Elsevier, vol. 115(5), pages 769-779, May.
    12. Renou, Ludovic & Tomala, Tristan, 2015. "Approximate implementation in Markovian environments," Journal of Economic Theory, Elsevier, vol. 159(PA), pages 401-442.
    13. Ankush Agarwal & Stefano de Marco & Emmanuel Gobet & Gang Liu, 2017. "Rare event simulation related to financial risks: efficient estimation and sensitivity analysis," Working Papers hal-01219616, HAL.
    14. Svetlana Ekisheva & Mark Borodovsky, 2011. "Uniform Accuracy of the Maximum Likelihood Estimates for Probabilistic Models of Biological Sequences," Methodology and Computing in Applied Probability, Springer, vol. 13(1), pages 105-120, March.
    15. Miasojedow, Błażej, 2014. "Hoeffding’s inequalities for geometrically ergodic Markov chains on general state space," Statistics & Probability Letters, Elsevier, vol. 87(C), pages 115-120.
    16. Boucher, Thomas R., 2009. "A Hoeffding inequality for Markov chains using a generalized inverse," Statistics & Probability Letters, Elsevier, vol. 79(8), pages 1105-1107, April.
    17. Simonot, F., 1995. "Sur l'approximation de la distribution stationnaire d'une chaîne de Markov stochastiquement monotone," Stochastic Processes and their Applications, Elsevier, vol. 56(1), pages 133-149, March.
    18. Yiqiang Q. Zhao & W. John Braun & Wei Li, 1999. "Northwest corner and banded matrix approximations to a Markov chain," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(2), pages 187-197, March.
    19. Jeffrey P. Kharoufeh & Dustin G. Mixon, 2009. "On a Markov‐modulated shock and wear process," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(6), pages 563-576, September.
    20. Choi, Michael C.H. & Li, Evelyn, 2019. "A Hoeffding’s inequality for uniformly ergodic diffusion process," Statistics & Probability Letters, Elsevier, vol. 150(C), pages 23-28.

    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:apmaco:v:414:y:2022:i:c:s0096300321006949. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.