Truncation Bounds for Approximations of Inhomogeneous Continuous-Time Markov Chains
Authors:
- A. I. ZeifmanA. I. Zeifman
- A. V. KorotyshevaAKA. V. Korotysheva
- V. Yu. KorolevV. Yu. Korolev
- Ya. A. SatinYSYa. A. Satin
- 1 January 2017
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in Theory of Probability & Its Applications
- Vol. 61 (3) , 513-520
Abstract
Weakly ergodic continuous-time countable Markov chains are studied. We obtain uniform in time bounds for approximations via truncations by analogous smaller chains under some natural assumptions.Keywords
This publication has 25 references indexed in Scilit:
- Error Bounds for Augmented Truncations of Discrete-Time Block-Monotone Markov Chains under Geometric Drift ConditionsAdvances in Applied Probability, 2015
- Periodic solution to the time-inhomogeneous multi-server Poisson queueOperations Research Letters, 2007
- Nonstationary Queues: Estimation of the Rate of ConvergenceQueueing Systems, 2004
- The Analysis of Queues with Time-Varying Rates for Telecommunication ModelsTelecommunication Systems, 2002
- An Exact Solution for an M(t)/M(t)/1 Queue with Time-Dependent Arrivals and ServiceQueueing Systems, 2002
- Exact and asymptotic solutions to a PDE that arises in time-dependent queuesAdvances in Applied Probability, 2000
- The M/M/1 queue with mass exodus and mass arrivals when emptyJournal of Applied Probability, 1997
- Diffusion approximation to a queueing system with time-dependent arrival and service ratesQueueing Systems, 1995
- Strong Approximations for Time-Dependent QueuesMathematics of Operations Research, 1995
- An Analysis of the Modified Offered-Load Approximation for the Nonstationary Erlang Loss ModelThe Annals of Applied Probability, 1994