Abstract:Abstract. The deviation matrix of an ergodic, continuous-time Markov chain with transition probability matrix P (.) and ergodic matrix Π is the matrixWe give conditions for D to exist and discuss properties and a representation of D. The deviation matrix of a birth-death process is investigated in detail. We also describe a new application of deviation matrices by showing that a measure for the convergence to stationarity of a stochastically increasing Markov chain can be expressed in terms of the elements of … Show more
“…For an irreducible, positive-recurrent, continuous-time Markov chain on the state space S with generator Q, this matrix was studied by Coolen-Schrijner and van Doorn in [6]. It is the matrix whose (i, j)th element is…”
Section: The Deviation Matrixmentioning
confidence: 99%
“…see [6]. Conversely, Equation (3.3) allows us to express the mean first passage times in terms of the entries of the deviation matrix:…”
Section: The Deviation Matrixmentioning
confidence: 99%
“…One involves the derivation of Markov renewal equations, conditioning on the first instance at which the state of the queue changes, a second involves expressing the value of capacity in terms of the entries of a transient analogue of the deviation matrix, discussed by Coolen-Schrijner and van Doorn in [6], and a third involves an elegant coupling argument.…”
Section: Introductionmentioning
confidence: 99%
“…First, in Section 2, we shall employ a Markov renewal analysis similar to that used in [5] for the M/M/C/C queue. Then, in Section 3, we shall relate this to a transient analogue of the deviation matrix defined in Coolen-Schrijner and van Doorn [6], at the same time deriving a number of interesting properties of this matrix. In Section 4, we shall adopt a completely different approach, coupling the evolution of M/M/1/C queues with different initial numbers of customers.…”
In an M/M/1/C queue, customers are lost when they arrive to find C customers already present. Assuming that each arriving customer brings a certain amount of revenue, we are interested in calculating the value of an extra waiting place in terms of the expected amount of extra revenue that the queue will earn over a finite time horizon [0, t].There are different ways of approaching this problem. One involves the derivation of Markov renewal equations, conditioning on the first instance at which the state of the queue changes, a second involves expressing the value of capacity in terms of the entries of a transient analogue of the deviation matrix, discussed by Coolen-Schrijner and van Doorn in [6], and a third involves an elegant coupling argument.In this paper, we shall compare and contrast these approaches and, in particular, use the coupling analysis to explain why the value of an extra unit of capacity remains the same when the arrival and service rates are interchanged when the queue starts at full capacity.
“…For an irreducible, positive-recurrent, continuous-time Markov chain on the state space S with generator Q, this matrix was studied by Coolen-Schrijner and van Doorn in [6]. It is the matrix whose (i, j)th element is…”
Section: The Deviation Matrixmentioning
confidence: 99%
“…see [6]. Conversely, Equation (3.3) allows us to express the mean first passage times in terms of the entries of the deviation matrix:…”
Section: The Deviation Matrixmentioning
confidence: 99%
“…One involves the derivation of Markov renewal equations, conditioning on the first instance at which the state of the queue changes, a second involves expressing the value of capacity in terms of the entries of a transient analogue of the deviation matrix, discussed by Coolen-Schrijner and van Doorn in [6], and a third involves an elegant coupling argument.…”
Section: Introductionmentioning
confidence: 99%
“…First, in Section 2, we shall employ a Markov renewal analysis similar to that used in [5] for the M/M/C/C queue. Then, in Section 3, we shall relate this to a transient analogue of the deviation matrix defined in Coolen-Schrijner and van Doorn [6], at the same time deriving a number of interesting properties of this matrix. In Section 4, we shall adopt a completely different approach, coupling the evolution of M/M/1/C queues with different initial numbers of customers.…”
In an M/M/1/C queue, customers are lost when they arrive to find C customers already present. Assuming that each arriving customer brings a certain amount of revenue, we are interested in calculating the value of an extra waiting place in terms of the expected amount of extra revenue that the queue will earn over a finite time horizon [0, t].There are different ways of approaching this problem. One involves the derivation of Markov renewal equations, conditioning on the first instance at which the state of the queue changes, a second involves expressing the value of capacity in terms of the entries of a transient analogue of the deviation matrix, discussed by Coolen-Schrijner and van Doorn in [6], and a third involves an elegant coupling argument.In this paper, we shall compare and contrast these approaches and, in particular, use the coupling analysis to explain why the value of an extra unit of capacity remains the same when the arrival and service rates are interchanged when the queue starts at full capacity.
“…where P m¼0 1 (P 2 P P ) m is often referred to as the group inverse; see, for instance, [2,4]. A general definition that is valid for any possibly periodic Markov chain can be found in, [14], for example.…”
This article provides series expansions of the stationary distribution of a finite Markov chain. This leads to an efficient numerical algorithm for computing the stationary distribution of a finite Markov chain. Numerical examples are given to illustrate the performance of the algorithm.
In this paper, we provide an uncertainty analysis for queueing-inventory models, by extending the multivariate Taylor series expansion methodology to such stochastic models. Specifically, we derive a closed-form expressions for the higher-order sensitivity of discrete-time Markov chain stationary distribution with respect to multiple parameter. We establish efficient bound on the remainder term corresponding to the multivariate Taylor series. Additionally, we estimate different quantities of interest of the output measures of the studied queueing-inventory model. Using the copulas theory, we also include the effect of the dependence structure of parameters. The efficacy of the proposed method is shown with several numerical examples and obtained numerical results are compared with those of Monte Carlo simulation.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.