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

Two Approaches to the Construction of Perturbation Bounds for Continuous-Time Markov Chains

Author

Listed:
  • Alexander Zeifman

    (Department of Applied Mathematics, Vologda State University, 160000 Vologda, Russia
    Institute of Informatics Problems of the Federal Research Center “Computer Science and Control”, Russian Academy of Sciences, 119333 Moscow, Russia
    Vologda Research Center of the Russian Academy of Sciences, 160014 Vologda, Russia)

  • Victor Korolev

    (Institute of Informatics Problems of the Federal Research Center “Computer Science and Control”, Russian Academy of Sciences, 119333 Moscow, Russia
    Faculty of Computational Mathematics and Cybernetics, Moscow State University, 119991 Moscow, Russia
    Department of Mathematics, School of Science, Hangzhou Dianzi University, Hangzhou 310018, China)

  • Yacov Satin

    (Department of Applied Mathematics, Vologda State University, 160000 Vologda, Russia)

Abstract

This paper is largely a review. It considers two main methods used to study stability and to obtain appropriate quantitative estimates of perturbations of (inhomogeneous) Markov chains with continuous time and a finite or countable state space. An approach is described to the construction of perturbation estimates for the main five classes of such chains associated with queuing models. Several specific models are considered for which the limit characteristics and perturbation bounds for admissible “perturbed” processes are calculated.

Suggested Citation

  • Alexander Zeifman & Victor Korolev & Yacov Satin, 2020. "Two Approaches to the Construction of Perturbation Bounds for Continuous-Time Markov Chains," Mathematics, MDPI, vol. 8(2), pages 1-25, February.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:2:p:253-:d:320838
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/2/253/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/2/253/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Zeifman, A. & Satin, Y. & Kiseleva, K. & Korolev, V. & Panfilova, T., 2019. "On limiting characteristics for a non-stationary two-processor heterogeneous system," Applied Mathematics and Computation, Elsevier, vol. 351(C), pages 48-65.
    2. Zeifman, A. I. & Isaacson, Dean L., 1994. "On strong ergodicity for nonhomogeneous continuous-time Markov chains," Stochastic Processes and their Applications, Elsevier, vol. 50(2), pages 263-273, April.
    3. Erik Doorn, 2011. "Rate of convergence to stationarity of the system M/M/N/N+R," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(2), pages 336-350, December.
    4. Zeifman, A.I. & Korolev, V.Yu., 2014. "On perturbation bounds for continuous-time Markov chains," Statistics & Probability Letters, Elsevier, vol. 88(C), pages 66-72.
    5. Zeifman, A.I. & Korolev, V.Yu. & Satin, Ya.A. & Kiseleva, K.M., 2018. "Lower bounds for the rate of convergence for continuous-time inhomogeneous Markov chains with a finite state space," Statistics & Probability Letters, Elsevier, vol. 137(C), pages 84-90.
    6. Zeifman, A.I., 1995. "Upper and lower bounds on the rate of convergence for nonhomogeneous birth and death processes," Stochastic Processes and their Applications, Elsevier, vol. 59(1), pages 157-173, September.
    7. Di Crescenzo, A. & Giorno, V. & Nobile, A.G. & Ricciardi, L.M., 2008. "A note on birth-death processes with catastrophes," Statistics & Probability Letters, Elsevier, vol. 78(14), pages 2248-2257, October.
    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. Ilya Usov & Yacov Satin & Alexander Zeifman & Victor Korolev, 2022. "Ergodicity Bounds and Limiting Characteristics for a Modified Prendiville Model," Mathematics, MDPI, vol. 10(23), pages 1-14, November.
    2. Yacov Satin & Rostislav Razumchik & Ilya Usov & Alexander Zeifman, 2023. "Numerical Computation of Distributions in Finite-State Inhomogeneous Continuous Time Markov Chains, Based on Ergodicity Bounds and Piecewise Constant Approximation," Mathematics, MDPI, vol. 11(20), pages 1-12, October.
    3. Yacov Satin & Rostislav Razumchik & Ivan Kovalev & Alexander Zeifman, 2023. "Ergodicity and Related Bounds for One Particular Class of Markovian Time—Varying Queues with Heterogeneous Servers and Customer’s Impatience," Mathematics, MDPI, vol. 11(9), pages 1-15, April.

    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. Yacov Satin & Alexander Zeifman & Alexander Sipin & Sherif I. Ammar & Janos Sztrik, 2020. "On Probability Characteristics for a Class of Queueing Models with Impatient Customers," Mathematics, MDPI, vol. 8(4), pages 1-15, April.
    2. Zeifman, A. & Satin, Y. & Kiseleva, K. & Korolev, V. & Panfilova, T., 2019. "On limiting characteristics for a non-stationary two-processor heterogeneous system," Applied Mathematics and Computation, Elsevier, vol. 351(C), pages 48-65.
    3. Zeifman, A.I. & Satin, Y.A. & Kiseleva, K.M., 2020. "On obtaining sharp bounds of the rate of convergence for a class of continuous-time Markov chains," Statistics & Probability Letters, Elsevier, vol. 161(C).
    4. Zeifman, A.I. & Korolev, V.Yu., 2014. "On perturbation bounds for continuous-time Markov chains," Statistics & Probability Letters, Elsevier, vol. 88(C), pages 66-72.
    5. Zeifman, A.I. & Korolev, V. Yu., 2015. "Two-sided bounds on the rate of convergence for continuous-time finite inhomogeneous Markov chains," Statistics & Probability Letters, Elsevier, vol. 103(C), pages 30-36.
    6. P. -C. G. Vassiliou, 2022. "Limiting Distributions of a Non-Homogeneous Markov System in a Stochastic Environment in Continuous Time," Mathematics, MDPI, vol. 10(8), pages 1-16, April.
    7. Yacov Satin & Alexander Zeifman & Anastasia Kryukova, 2019. "On the Rate of Convergence and Limiting Characteristics for a Nonstationary Queueing Model," Mathematics, MDPI, vol. 7(8), pages 1-11, July.
    8. André de Palma & Claude Lefèvre, 2018. "Bottleneck models and departure time problems," Working Papers hal-01581519, HAL.
    9. Yacov Satin & Rostislav Razumchik & Ivan Kovalev & Alexander Zeifman, 2023. "Ergodicity and Related Bounds for One Particular Class of Markovian Time—Varying Queues with Heterogeneous Servers and Customer’s Impatience," Mathematics, MDPI, vol. 11(9), pages 1-15, April.
    10. Korolev, V.Yu. & Chertok, A.V. & Korchagin, A.Yu. & Zeifman, A.I., 2015. "Modeling high-frequency order flow imbalance by functional limit theorems for two-sided risk processes," Applied Mathematics and Computation, Elsevier, vol. 253(C), pages 224-241.
    11. Zeifman, A.I. & Korolev, V.Yu. & Satin, Ya.A. & Kiseleva, K.M., 2018. "Lower bounds for the rate of convergence for continuous-time inhomogeneous Markov chains with a finite state space," Statistics & Probability Letters, Elsevier, vol. 137(C), pages 84-90.
    12. Ekaterina Markova & Yacov Satin & Irina Kochetkova & Alexander Zeifman & Anna Sinitcina, 2020. "Queuing System with Unreliable Servers and Inhomogeneous Intensities for Analyzing the Impact of Non-Stationarity to Performance Measures of Wireless Network under Licensed Shared Access," Mathematics, MDPI, vol. 8(5), pages 1-13, May.
    13. Zeifman, Alexander, 2021. "Bounds on the rate of convergence for Markovian queuing models with catastrophes," Statistics & Probability Letters, Elsevier, vol. 176(C).
    14. Antonio Crescenzo & Virginia Giorno & Balasubramanian Krishna Kumar & Amelia G. Nobile, 2012. "A Double-ended Queue with Catastrophes and Repairs, and a Jump-diffusion Approximation," Methodology and Computing in Applied Probability, Springer, vol. 14(4), pages 937-954, December.
    15. Alexander Zeifman & Yacov Satin & Ksenia Kiseleva & Victor Korolev, 2019. "On the Rate of Convergence for a Characteristic of Multidimensional Birth-Death Process," Mathematics, MDPI, vol. 7(5), pages 1-10, May.
    16. Satin, Y.A. & Razumchik, R.V. & Zeifman, A.I. & Kovalev, I.A., 2022. "Upper bound on the rate of convergence and truncation bound for non-homogeneous birth and death processes on Z," Applied Mathematics and Computation, Elsevier, vol. 423(C).
    17. Di Crescenzo, Antonio & Giorno, Virginia & Nobile, Amelia G., 2016. "Constructing transient birth–death processes by means of suitable transformations," Applied Mathematics and Computation, Elsevier, vol. 281(C), pages 152-171.
    18. Erik Doorn, 2011. "Rate of convergence to stationarity of the system M/M/N/N+R," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(2), pages 336-350, December.
    19. Antonio Di Crescenzo & Virginia Giorno & Balasubramanian Krishna Kumar & Amelia G. Nobile, 2018. "A Time-Non-Homogeneous Double-Ended Queue with Failures and Repairs and Its Continuous Approximation," Mathematics, MDPI, vol. 6(5), pages 1-23, May.
    20. Guodong Pang & Andrey Sarantsev & Yuri Suhov, 2022. "Birth and death processes in interactive random environments," Queueing Systems: Theory and Applications, Springer, vol. 102(1), pages 269-307, October.

    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:8:y:2020:i:2:p:253-:d:320838. 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.