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

On One Approach to Obtaining Estimates of the Rate of Convergence to the Limiting Regime of Markov Chains

Author

Listed:
  • Yacov Satin

    (Department of Applied Mathematics, Vologda State University, 15 Lenina Str., 160000 Vologda, Russia)

  • Rostislav Razumchik

    (Federal Research Center “Computer Science and Control”, Russian Academy of Sciences, 44-2 Vavilova Str., 119333 Moscow, Russia)

  • Alexander Zeifman

    (Department of Applied Mathematics, Vologda State University, 15 Lenina Str., 160000 Vologda, Russia
    Federal Research Center “Computer Science and Control”, Russian Academy of Sciences, 44-2 Vavilova Str., 119333 Moscow, Russia
    Vologda Research Center, Russian Academy of Sciences, 556A Gorky Str., 160014 Vologda, Russia
    Moscow Center for Fundamental and Applied Mathematics, Moscow State University, 119991 Moscow, Russia)

  • Ilya Usov

    (Department of Applied Mathematics, Vologda State University, 15 Lenina Str., 160000 Vologda, Russia)

Abstract

We revisit the problem of the computation of the limiting characteristics of (in)homogeneous continuous-time Markov chains with the finite state space. In general, it can be performed only numerically. The common rule of thumb is to interrupt calculations after quite some time, hoping that the values at some distant time interval will represent the sought-after solution. Convergence or ergodicity bounds, when available, can be used to answer such questions more accurately; i.e., they can indicate how to choose the position and the length of that distant time interval. The logarithmic norm method is a general technique that may allow one to obtain such bounds. Although it can handle continuous-time Markov chains with both finite and countable state spaces, its downside is the need to guess the proper similarity transformations, which may not exist. In this paper, we introduce a new technique, which broadens the scope of the logarithmic norm method. This is achieved by firstly splitting the generator of a Markov chain and then merging the convergence bounds of each block into a single bound. The proof of concept is illustrated by simple examples of the queueing theory.

Suggested Citation

  • Yacov Satin & Rostislav Razumchik & Alexander Zeifman & Ilya Usov, 2024. "On One Approach to Obtaining Estimates of the Rate of Convergence to the Limiting Regime of Markov Chains," Mathematics, MDPI, vol. 12(17), pages 1-12, September.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:17:p:2763-:d:1472827
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/17/2763/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/17/2763/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Richard V. Evans, 1967. "Geometric Distribution in Some Two-Dimensional Queuing Systems," Operations Research, INFORMS, vol. 15(5), pages 830-846, October.
    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.
    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. Fadiloglu, Mehmet Murat & Yeralan, Sencer, 2001. "A general theory on spectral properties of state-homogeneous finite-state quasi-birth-death processes," European Journal of Operational Research, Elsevier, vol. 128(2), pages 402-417, January.
    2. 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.
    3. 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.
    4. 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).
    5. 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.
    6. Baoxian Chang & Qingqing Ye & Jun Lv & Tao Jiang, 2019. "Mathematical modelling of a tollbooth system with two parallel skill-based servers and two vehicle types," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(3), pages 479-501, 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:12:y:2024:i:17:p:2763-:d:1472827. 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.