IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v22y2020i1d10.1007_s11009-019-09708-6.html
   My bibliography  Save this article

Weak stability bounds for approximations of invariant measures with applications to queueing

Author

Listed:
  • Badredine Issaadi

    (University of Boumerdes
    University of Bejaia, Targua Ouzemour)

Abstract

This paper investigate the approximation of invariant distributions for countable space Markov chains using truncations of the transition matrix. We use the weak perturbation theory to establish analytic error bounds in the GI/M/1 model and a tandem queue with blocking. Numerical examples are carried out to illustrate the quality of the obtained error bounds.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:metcap:v:22:y:2020:i:1:d:10.1007_s11009-019-09708-6
    DOI: 10.1007/s11009-019-09708-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-019-09708-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-019-09708-6?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. Badredine Issaadi & Karim Abbas & Djamil Aïssani, 2017. "Perturbation Analysis of the GI/M/s Queue," Methodology and Computing in Applied Probability, Springer, vol. 19(3), pages 819-841, September.
    2. 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.
    3. Nico M. van Dijk, 1991. "Truncation of Markov Chains with Applications to Queueing," Operations Research, INFORMS, vol. 39(6), pages 1018-1026, December.
    4. Hervé, Loïc & Ledoux, James, 2014. "Approximating Markov chains and V-geometric ergodicity via weak perturbation theory," Stochastic Processes and their Applications, Elsevier, vol. 124(1), pages 613-638.
    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. 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.
    2. 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).
    3. Loic Hervé & James Ledoux, 2020. "State-Discretization of V-Geometrically Ergodic Markov Chains and Convergence to the Stationary Distribution," Methodology and Computing in Applied Probability, Springer, vol. 22(3), pages 905-925, September.
    4. van Dijk, Nico M., 2008. "Error bounds for state space truncation of finite Jackson networks," European Journal of Operational Research, Elsevier, vol. 186(1), pages 164-181, April.
    5. 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.
    6. Cruz, Juan Alberto Rojas, 2020. "Sensitivity of the stationary distributions of denumerable Markov chains," Statistics & Probability Letters, Elsevier, vol. 166(C).
    7. Hervé, Loïc & Ledoux, James, 2016. "A computable bound of the essential spectral radius of finite range Metropolis–Hastings kernels," Statistics & Probability Letters, Elsevier, vol. 117(C), pages 72-79.
    8. 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.
    9. Jianyu Cao & Weixin Xie, 2017. "Stability of a two-queue cyclic polling system with BMAPs under gated service and state-dependent time-limited service disciplines," Queueing Systems: Theory and Applications, Springer, vol. 85(1), pages 117-147, February.

    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:spr:metcap:v:22:y:2020:i:1:d:10.1007_s11009-019-09708-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.