Tail Asymptotics in any direction of the stationary distribution in a two-dimensional discrete-time QBD process
Abstract
We consider a discrete-time two-dimensional quasi-birth-and-death process (2d-QBD process for short) on , where is the level state, the phase state (background state) and a finite set, and study asymptotic properties of the stationary tail distribution. The 2d-QBD process is an extension of usual one-dimensional QBD process. By using the matrix analytic method of the queueing theory and the complex analytic method, we obtain the asymptotic decay rate of the stationary tail distribution in any direction. This result is an extension of the corresponding result for a certain two-dimensional reflecting random work without background processes, obtained by using the large deviation techniques. We also present a condition ensuring the sequence of the stationary probabilities geometrically decays without power terms, asymptotically. Asymptotic properties of the stationary tail distribution in the coordinate directions in a 2d-QBD process have already been studied in the literature. The results of this paper are also important complements to those results.
Keywards: quasi-birth-and-death process, Markov modulated reflecting random walk, Markov additive process, asymptotic decay rate, stationary distribution, matrix analytic method
Mathematics Subject Classification: 60J10, 60K25
1 Introduction
We deal with a two-dimensional discrete-time quasi-birth-and-death process (2d-QBD process for short), which is an extension of ordinary one dimensional QBD process (see, for example, Latouche and Ramaswami [10]), and study asymptotic properties of the stationary tail distribution in any direction. The 2d-QBD process is also a two-dimensional skip-free Markov modulated reflecting random walk (2d-MMRRW for short), and the 2d-MMRRW is a two-dimensional skip-free reflecting random walk (2d-RRW for short) having a background process. Asymptotics of the stationary distributions in various 2d-RRWs without background processes have been investigated in the literature for several decades, especially, by Masakiyo Miyazawa and his colleagues (see a survey paper [13] of Miyazawa and references therein). Some of their results have been extended to the 2d-QBD process in Ozawa [20], Miyazawa [14] and Ozawa and Kobayashi [21], where the asymptotic decay rates and exact asymptotic formulae of the stationary distribution in the coordinate directions were obtained (cf. results in Miyazawa [12] and Kobayashi and Miyazawa [9]). In this paper, we further extend it to an arbitrary direction. In Miyazawa [14], the tail decay rates of the marginal stationary distribution in an arbitrary direction have also been obtained.
Let a Markov chain be a 2d-QBD process on the state space , where , is a finite set with cardinality , i.e., , and is the set of all nonnegative integers. The process is called the level process, the phase process (background process), and the transition probabilities of the level process vary according to the state of the phase process. This modulation is space homogeneous except for the boundaries of . The level process is assumed to be skip free, i.e., for any , . Stochastic models arising from various Markovian two-queue models and two-node queueing networks such as two-queue polling models and generalized two-node Jackson networks with Markovian arrival processes and phase-type service processes can be represented as two-dimensional continuous-time QBD processes, and their stationary distributions can be analyzed through the corresponding two-dimensional discrete-time QBD processes obtained by the uniformization technique; See, for example, Refs. [14, 20, 23]. In that sense, 2d-QBD processes are more versatile than 2d-RRWs, which have no background processes. This is a reason why we are interested in stochastic models with a background process. Here we emphasize that the assumption of skip-free is not so restricted since any 2d-MMRRW with bounded jumps can be represented as a 2d-MMRRW with skip-free jumps (i.e., 2d-QBD process); See Introduction of Ozawa [24].
Denote by the set of all the subsets of , i.e., , and we use it as an index set. Divide into exclusive subsets defined as
The class is a partition of . is the set containing only the origin, and is the set of all positive points in . Let be the transition probability matrix of the 2d-QBD process and represent it in block form as , where and . For and , let be a one-step transition probability block from a state in , which is defined as
where we assume the blocks corresponding to impossible transitions are zero (see Fig. 1).

For example, if , we have for . Since the level process is skip free, for every , is given by
(1.1) |
We assume the following condition throughout the paper.
Assumption 1.1.
The 2d-QBD process is irreducible and aperiodic.
Next, we define several Markov chains derived from the 2d-QBD process. For a nonempty set , let be a process derived from the 2d-QBD process by removing the boundaries that are orthogonal to the -axis for each . To be precise, the process is a Markov chain on whose transition probability matrix is given as
(1.2) |
where is the set of all positive integers. The process on and its transition probability matrix are analogously defined. The process is a Markov chain on , whose transition probability matrix is given as
(1.3) |
Regarding as the additive part, we see that the process is a Markov additive process (MA-process for short) with the background state (see, for example, Ney and Nummelin [18]). The process is also an MA-process, where is the additive part and the background state, and an MA-process, where the additive part and the background state. We call them the induced MA-processes derived from the original 2d-QBD process. Their background processes are called induced Markov chains in Fayolle et. al. [4]. Let be the Markov additive kernel (MA-kernel for short) of the induced MA-process , which is the set of transition probability blocks and defined as, for ,
Let be the MA-kernel of , defined in the same manner. With respect to , the MA-kernel is given by . We assume the following condition throughout the paper.
Assumption 1.2.
The induced MA-processes , and are irreducible and aperiodic.
Let and be the matrix generating functions of the kernels of and , respectively, defined as
The matrix generating function of the kernel of is given by , defined as
Note that we use generating functions instead of moment generating functions in the paper because the generating functions are more suitable for complex analysis. Let , and be regions in which the convergence parameters of , and are greater than , respectively, i.e.,
By Lemma A.1 of Ozawa [24], and are log-convex in , and the closures of and are convex sets; is also log-convex in , and the closure of is a convex set. Furthermore, by Proposition B.1 of Ozawa [24], is bounded under Assumption 1.2.
Assuming is positive recurrent (a condition for this will be given in the next section), we denote by the stationary distribution of , where , and is the stationary probability that the 2d-QBD process is in the state in steady state. Let be an arbitrary discrete direction vector and, for , define a real value as
(1.4) |
where is the inner product of vectors ad . Our main aim is to demonstrate under certain conditions that, for any ,
(1.5) |
i.e., the asymptotic decay rate of the stationary distribution in direction is given by the smaller of and . We also present a condition ensuring the sequence geometrically decays without power terms. We prove them by using the matrix analytic method of the queueing theory as well as the complex analytic method; the former has been introduced by Marcel Neuts and developed in the literature; See, for example, Refs. [1, 10, 16, 17]. Our model is a kind of multidimensional reflecting process, and asymptotics in various multidimensional reflecting processes have been investigated in the literature for several decades; See Miyazawa [13] and references therein. -partially homogeneous ergodic Markov chains discussed in Borovkov and Mogul’skiĭ [2] are Markov chains on the positive quadrant including 2d-RRWs as a special case. For those Markov chains, a formula corresponding to (1.5) have been obtained by using the large deviations techniques; See Theorem 3.1 of Borovkov and Mogul’skiĭ [2] and also see Proposition 5.1 of Miyazawa [12] for the case of 2d-RRW. They have considered only models without background processes. In Dai and Miyazawa [3], results parallel to ours have been obtained for a two-dimensional continuous-state Markov process, named semimartingale-reflecting Brownian motion (SRBM for short). The 2d-SRBM is also a model without background processes. With respect to models with a background process, asymptotics of the stationary distribution in a Markov modulated fluid network with a finite number of stations have recently been studied in Miyazawa [15], where upper and lower bounds for the stationary tail decay rate in various directions were obtained by using so-called Dynkin’s formula.
The rest of the paper is organized as follows. In Section 2, we give a stability condition for the 2d-QBD process and define the asymptotic decay rates of the stationary distribution. In the same section, we introduce a key formula representing the stationary distribution in terms of the fundamental (potential) matrix of the induced MA-process . We call it a compensation equation. Furthermore, we define block state processes derived from the original 2d-QBD process, which will be used for proving propositions in the following sections. A summary of their properties is given in Appendix A. In Section 3, we obtain the asymptotic decay rate of the stationary distribution in any direction. First, we obtain it in the case where the direction vector is given by . The asymptotic decay rate for a general direction vector is obtained from the results in the case of , by using the block state process. In Section 4, we explain a geometric property of the asymptotic decay rates and give an example of two-queue model. In the two-queue model, the asymptotic decay rate corresponds to the decreasing rate of the joint queue length probability in steady state when the queue lengths of both the queues simultaneously enlarge. The paper concludes with a remark about the relation between our analysis and the large deviation techniques in Section 5.
Notation for vectors and matrices. For a matrix , we denote by the -entry of and by the transpose of . If , . Similar notations are also used for vectors. The convergence parameter of a nonnegative square matrix with a finite or countable dimension is denoted by , i.e., . For a finite square matrix , we denote by the spectral radius of , which is the maximum modulus of eigenvalue of . If is nonnegative, corresponds to the Perron-Frobenius eigenvalue of and we have . is a matrix of ’s, is a column vector of ’s and is a column vector of ’s; their dimensions, which are finite or countably infinite, are determined in context. is the identity matrix. For an matrix , is the vector of stacked columns of , i.e., .
2 Preliminaries
2.1 Stability condition
Let , and be the mean drifts of the additive part in the induced MA-processes , and , respectively, i.e.,
where . By Corollary 3.1 of Ozawa [23], the stability condition of the 2d-QBD process is given as follows:
Lemma 2.1.
-
(i)
In the case where and , the 2d-QBD process is positive recurrent if and , and it is transient if either or .
-
(ii)
In the case where and , is positive recurrent if , and it is transient if .
-
(iii)
In the case where and , is positive recurrent if , and it is transient if .
-
(iv)
If one of and is positive and the other is non-negative, then is transient.
Each mean drift is represented in terms of the stationary distribution of the corresponding induced Markov chain, i.e., the background process of the corresponding induced MA-process; for their expressions, see Subsection 3.1 of Ozawa [23] and its related parts. We assume the following condition throughout the paper.
Assumption 2.1.
The condition in Lemma 2.1 that ensures the 2d-QBD process is positive recurrent holds.
2.2 Compensation equation
Consider the induced MA-process on . Its transition probability matrix is given by . Denote by the fundamental matrix (potential matrix) of , i.e., . Under Assumption 2.1, since at least one element of the mean drift vector of , or , is negative, is entry-wise finite. Since the transition probabilities of are space-homogeneous with respect to the additive part, we have for every and for every that
(2.1) |
Furthermore, satisfies the following property.
Proposition 2.1.
is entry-wise bounded.
Proof.
By (2.1), it suffices to show that, for every ,
(2.2) |
where we use the fact that is finite. Let be the first hitting time of to the state , i.e.,
Since is a stopping time, we have by the strong Markov property of that
(2.3) | ||||
(2.4) | ||||
(2.5) | ||||
(2.6) |
Since is entry-wise finite, this implies inequality (2.2). ∎
Remark 2.1.
From the proof of the proposition, we see that, for every ,
(2.7) |
From , we construct another Markov chain on , denoted by , by replacing the transition probabilities from the states in with those of the original 2d-QBD process. To be precise, the transition probability matrix of , denoted by , is given as
The subspace is a unique closed communication class (irreducible class) of the Markov chain and its stationary distribution, , is given as
where is the stationary distribution of the original 2d-QBD process. The stationary distribution satisfies the stationary equation . We have the following.
Proposition 2.2.
Under Assumption 2.1, is elementwise bounded.
Proof.
Since is a probability distribution, by Remark 2.1, we have for any that
(2.8) |
Hence, the assertion of the proposition holds. ∎
Lemma 2.2.
(2.10) |
Proof.
By the Fubini’s theorem, we have , elementwise. Hence,
where corresponds to a Riesz decomposition of in the case where the harmonic function term is equivalent to zero; See Theorem 3.1 of Nummelin [19]. ∎
Equation (2.10) can also be derived by the compensation method discussed in Keilson [8]. We, therefore, call it a compensation equation. Its remarkable point is that the nonzero entries of are restricted to the transition probabilities from the states in . Hence, we immediately obtain, for ,
(2.11) | ||||
(2.12) | ||||
(2.13) |
where any corresponding to impossible transitions is assumed to be zero. Equation (2.13) plays a crucial role in the following section.
2.3 Asymptotic decay rates
Let be an arbitrary discrete direction vector. For , define lower and upper asymptotic decay rates and as
By the Cauchy-Hadamard theorem, the radius of convergence of the power series of the sequence is given by . If , we denote them by and call it the asymptotic decay rate. Under Assumption 1.2, the following property holds.
Proposition 2.3.
For every , and .
Since the proof of the proposition is elementary, we give it in Appendix B. Hereafter, we denote , and by , and , respectively. The asymptotic decay rates in the coordinate directions, denoted by and , have already been obtained in Ozawa [20].
Let be a lossy Markov chain derived from the induced MA-process by restricting the state space of the additive part to . To be precise, the process is a Markov chain on whose transition probability matrix is given as
(2.14) |
where is strictly substochastic. Let be the fundamental matrix (potential matrix) of , i.e.,
We assume the following condition throughout the paper.
Assumption 2.2.
is irreducible and aperiodic.
This condition implies that the induced MA-process is irreducible and aperiodic, cf. Assumption 1.2. By Theorem 5.1 of Ozawa [24], we have, for any direction vector , every such that or , every and every ,
(2.15) |
Since the stationary distribution of the 2d-QBD process can be represented in terms of the entries of (see Section 6 of Ozawa [24]), this formula leads us to the following.
Lemma 2.3.
(2.16) |
2.4 Block state process
For , we consider another 2d-QBD process derived from the original 2d-QBD process by regarding each block of level as a level (see, for example, Subsection 4.2 of Ozawa [24]). For , denote by and the quotient and remainder of divided by , respectively, i.e.,
where and . Define a process as
where is the level state and the phase state. The process is a 2d-QBD process and its state space is given by , where . We call a -block state process. The transition probability matrix of , denoted by , has the same block structure as . For and , denote by the transition probability block of corresponding to of , then can be represented by using . We omit the explicit expressions for the transition probability blocks since we do not use them directly. Let be the stationary distribution of , where
and is the stationary distribution of the original 2d-QBD process. Denote by and the asymptotic decay rates of the sequences and , respectively, i.e., for , and ,
where and do not depend on any of , and . Since is a 2d-QBD process and inherits the nature of the original 2d-QBD process, the results obtained in Refs. [20, 21] also hold for . For example, we have and . For later use, we summarize the properties of in Appendix A, and here define, for , the asymptotic decay rate in direction , , as
where , and are arbitrary.
3 Asymptotics in an arbitrary direction
Hereafter, we use the following notation: For , and are the open disk and circle of center and radius on the complex plane, respectively. For such that , is the open annular domain defined as .
3.1 Methodology and preparation
For , define the generating function of the stationary probabilities of the 2d-QBD process in direction , , as
where is a complex variable. Furthermore, define real values and as
For any , if the power series is absolutely convergent at , then we have by the Caucy-Hadamard theorem that . This and (2.16) imply . We use this procedure for obtaining the asymptotic decay rate when is given by .
On the other hand, when is less than , we demonstrate that for a certain point ,
(3.1) |
and that the complex function is analytic in . In this case, by Theorem VI.4 of Flajolet and Sedgewick [5], the exact asymptotic formula for the sequence is given by and we have .
For , let and be the set of integers less than or equal to and that of integers greater than or equal to , respectively. We introduce additional assumptions.
Assumption 3.1.
-
(i)
The lossy Markov chain derived from the induced MA-process by restricting the state space to is irreducible and aperiodic.
-
(ii)
The lossy Markov chain derived from by restricting the state space to is irreducible and aperiodic.
Remark 3.1.
Let be a direction vector, and define subspaces and as
is the upper-left space of the line , and the lower-right space of the same line. Due to the space-homogeneity of with respect to the additive part, under part (i) of Assumption 3.1, the lossy Markov chain derived from by restricting the state space to is irreducible and aperiodic, and under part (ii) of Assumption 3.1, that derived from by restricting the state space to is irreducible and aperiodic. We will use this property later.
Assumption 3.1 seems rather strong and it can probably be replaced with other weaker one. We adopt the assumption since it makes discussions simple; See Remark 3.2 in the following subsection.
For , define the matrix generating function of the blocks of in direction , , as
The matrix generating function satisfies the following.
Proposition 3.1.
For every , is absolutely convergent and entry-wise analytic in the open annual domain .
Proof.
For every , we have for any that
(3.2) | ||||
(3.3) |
where we use the identity . Since the closure of is a convex set, is, therefore, absolutely convergent in . As a result, is analytic in since each entry of is represented as a Laurent series of (see, for example, Section II.1 of Markushevich [11]). ∎
By compensation equation (2.13), is given in terms of by
(3.4) |
where
(3.5) | |||
(3.6) | |||
(3.7) |
For , let be the supremum point of the convergence domain of , defined as
By Proposition 3.1, we immediately obtain the following.
Proposition 3.2.
is absolutely convergent and elementwise analytic in , and we have .
We analyze and in the following subsection.
3.2 In the case of direction vector
In overall this subsection, we assume .
First, focusing on , we construct a new skip-free MA-process from and apply the matrix analytic method to the MA-process. The new MA-process is denoted by , where , and are the quotient and remainder of divided by , respectively, and (see Fig. 2).

The state space of is , and and are the additive part (level state) and background state (phase state), respectively. The additive part of is skip free, and this is a reason why we consider this new MA-process. From the definition, if and in the new MA-process, it follows that , in the original MA-process. Hence, means . Here we note that is slightly different from the -block state process derived from ; See Subsection 2.4. In the latter process, the state corresponds to the state of the original MA-process. Denote by the transition probability matrix of , which is given as
where
Denote by the fundamental matrix of , i.e., , and for , define a matrix generating function as
(3.8) |
By Proposition 3.1, for every , is entry-wise analytic in the open annual domain . Define blocks as and
For , define the following matrix generating functions:
Define a vector generating function as
(3.9) | ||||
(3.10) |
where, for ,
and hence, for , . Since
(3.11) | ||||
(3.12) |
we analyze instead of . Let be the supremum point of the convergence domain of , defined as
By (3.11), we have .
Next, we obtain a tractable representation for . Since is space-homogeneous with respect to the additive part, we have, for every ,
(3.13) |
Define a stopping time as
This is the first hitting time to the subspace , which corresponds to the subspace of the original MA-process (see Fig. 2). For , and , let be the probability that the MA-process starting from visits a state in for the first time and the state is , i.e.,
We denote the matrix of them by , i.e., . When , we omit the superscript such as . Since is space-homogeneous, we have . By the strong Markov property, for and , is represented in terms of as
(3.14) |
and this leads us to
(3.15) |
where
(3.16) |
and we use (3.13). Since is skip free and space-homogeneous, we have by the strong Markov property that
(3.17) |
As a result, by (3.10), (3.13), (3.15) and (3.17), we obtain
(3.18) |
We make a preparation for analyzing through (3.18). Define a matrix generating function of transition probability blocks as
Define a domain as
whose closure is a convex set, and define the extreme values and of as

For , let and be the two real roots to the following equation:
counting multiplicity, where (see Fig. 3). The matrix generating function corresponds to a so-called G-matrix in the matrix analytic method of the queueing theory (see, for example, Neuts [16]). For , consider the following matrix quadratic equation:
(3.19) |
then is given by the minimum nonnegative solution to the equation, and we have by Lemma 2.5 of Ozawa [24] that
(3.20) |
Let be the maximum eigenvalue of and be other eigenvalues, counting multiplicity. We have, for , . satisfies the following properties.
Proposition 3.3.
-
(i)
is absolutely convergent and entry-wise analytic in the open annual domain .
-
(ii)
For every , . Furthermore, if , then .
-
(iii)
For every , for every .
Proof.
Since is given by Laurent series (3.16) and it is absolutely convergent in the closure of , we immediately obtain part (i) of the proposition (see, for example, Section II.1 of Markushevich [11]). By Lemma 4.1 of Ozawa and Kobayashi [21], for every , , and we obtain the first half of part (ii) of the proposition. The second half is obtained by part (i) of Lemma 4.3 of Ref. [21]. Since, under Assumption 3.1, the lossy Markov chain derived from by restricting the state space to is irreducible (see Remark 3.1), every column of is positive or zero (see Appendix C of Ozawa [24]; a result similar to that holding for rate matrices also holds for G-matrices). Hence, nonnegative matrix has just one primitive class (irreducible and aperiodic class), and this implies part (iii) of the proposition. ∎
We get back to (3.18) and apply results in Ref. [21]. For , define and as
(3.21) |
then we have and ; For another equivalent definition of and and for the properties of and , see Appendix A. Since for , the radius of convergence of the power series of the sequence is given by . Taking this point into account, we define and as
Since , we have . The following is a key proposition for analyzing .
Proposition 3.4.
-
(i)
We always have .
-
(ii)
If and , then is elementwise analytic in .
-
(iii)
If and , then and, for some positive vector ,
(3.22)
Before proving the proposition, we give one more proposition. Let be the stationary probability vectors in the (1,2)-block state process derived from the original 2d-QBD process; See Subsection 2.4 and Appendix A. Since is a 2d-QBD process, we can apply results in Ref. [21]. Define a vector generating function as
which is identical to since we have for every . If (for the definitions of and , see Appendix A), then is classified into Type I () or Type II in the notation of Ref. [21], where inequality corresponds to . In our case, inequality implies this condition since and . Therefore, if , we see by Corollary 5.1 of Ref. [21] that is a pole of , and the same property also holds for . Define as
where is the G-matrix generated from the triplet (see Subsection 4.1 of Ref. [21]) and satisfies the following matrix quadratic equation:
(3.23) |
By the definition, is identical to of the -block state process (for the definition of , see Appendix A). Let and be the left and right eigenvectors of with respect to the maximum eigenvalue of , satisfying . By Corollary 5.1 of Ref. [21], considering correspondence between and , we immediately obtain the following.
Proposition 3.5.
If , then and for some positive constant ,
(3.24) |
where is positive.
Note that, under Assumption 3.1, the modulus of every eigenvalue of except for the maximum one is less than (see Proposition 3.3), and it is not necessary for using Corollary 5.1 of Ref. [21] to assume all the eigenvalues of are distinct (i.e., Assumption 2.5 of Ref. [21]).
Proof of Proposition 3.4.
Temporary, define as
where is a matrix or scalar. By (3.18) and (3.19), is represented as
where
Later, we will prove that and (see (3.35)). Hence, by Proposition 3.1 and expression (3.8), is absolutely convergent in . We, therefore, focus on . Let be the Jordan decomposition of . Since , we have
(3.25) |
where is the Kronecker product and we use the identity for matrices , and (for the identity, see Horn and Johnson [7]). Define a real value as
(3.26) |
then is strictly increasing in . Hence, by part (ii) of Proposition 3.3, for every , . Since is the radius of convergence of the power series of the sequence , we see that, for every , each entry of is absolutely convergent in . As a result, as well as is absolutely convergent in and we obtain . This completes the proof of part (i) of the proposition.
Next, supposing , we consider the case where . In this case, we have and since and . We prove part (ii) of the proposition in a manner similar to that used in the proof of Proposition 5.1 of Ref. [21], which is given in Ozawa and Kobayashi [22]. Let be an complex matrix. For , if , is absolutely convergent, and by Lemma 3.2 of Ref. [21], we see that if , each element of is absolutely convergent. This implies that each element of is analytic as a complex function of variables in . By parts (i) and (ii) of Proposition 3.3, for any , is entry-wise analytic at and , where is given by (3.26). Hence, the composite function is elementwise analytic in . Under Assumption 2.1, since we have , and , if then for every . Hence, we can replace with and see that is elementwise analytic in . By Proposition 3.1 and expression (3.8), is also entry-wise analytic in the same domain. This completes the proof of part (ii) of the proposition.
Finally, supposing , we consider the case where again. By part (iii) of Proposition 3.3, is a simple eigenvalue of , and the modulus of every eigenvalue of except for is less than . Hence, we have, for every ,
where we assume without loss of generality. By (3.25), this leads us to
(3.27) |
where and are the left and right eigenvectors of with respect to the eigenvalue , satisfying . By Proposition 3.5, we have
(3.28) | ||||
(3.29) |
where , and is a positive constant. Since is strictly increasing in , we have , and this implies . As a result, we obtain
(3.30) |
In a manner similar to that used in the proof of Lemma 5.5 (part (1)) of Ref. [21], it can be seen that . Since is irreducible, is positive, and it implies that is also positive. This completes the proof of part (iii) of the proposition. ∎
Remark 3.2.
In Ref. [21], the matrix corresponding to is assumed to have distinct eigenvalues, but that assumption is not necessary in our case. In the proof of Proposition 3.4, the condition required for is that when , the maximum eigenvalue is simple and satisfies for every . As a condition ensuring this point, we have adopted Assumption 3.1. Under the assumption, the same property also holds for every direction vector in , see the following subsection.
Proposition 3.4 is represented in terms of the parameters given based on the MA-process such as and . We redefined those parameters so that they are given based on the induced MA-process . Define a matrix generating function as
where, for a block matrix , we denote by the -block of . This matrix function satisfies
(3.31) |
By Remark 2.4 of Ozawa [24], we have
(3.32) |
and this leads us to
(3.33) |

For , let and be the two real roots of the simultaneous equations:
(3.34) |
counting multiplicity, where and (see Fig. 4). Since equation is equivalent to , we have
(3.35) |
and and are given by
(3.36) | |||
(3.37) |
Hereafter, we denote and by and , respectively, and use (3.36) and (3.37) as their definitions. Note that, for and , we use subscript “2” instead of “1” since they are defined by using and . has already been defined in Section 1. Here we redefine it for the case of . After, we also redefine . In terms of these parameters, we rewrite Proposition 3.4 as follows.
Corollary 3.1.
-
(i)
We always have .
-
(ii)
If and , then is elementwise analytic in .
-
(iii)
If and , then and, for some positive vector ,
(3.38)
Define and analogously to and , respectively. Then, we have . Define and as
(3.39) | |||
(3.40) |
With respect to , interchangeing the -axis with the -axis, we immediately obtain by Corollary 3.1 the following.
Corollary 3.2.
-
(i)
We always have .
-
(ii)
If and , then is elementwise analytic in .
-
(iii)
If and , then and, for some positive vector ,
(3.41)
By Proposition 3.2 and Corollaries 3.1 and 3.2, we obtain a main result of this subsection as follows.
Theorem 3.1.
We have , and if , the sequence geometrically decays with ratio as tends to infinity, i.e., for some positive vector ,

Proof.
Recall that . This is absolutely convergent and elementwise analytic in since is the radius of the convergence of . With respect to the values of and , we consider the following cases.
(2) . By Proposition 3.2 and Corollary 3.2, and . We have and this implies that (see Fig. 5, where we assume ). Hence, by part (iii) of Corollary 3.1, elementwise diverges at , and we have . Since and , and as well as are elementwise analytic on . By part (ii) of Corollary 3.1, as well as is elementwise analytic on . Hence, is elementwise analytic in . As a result, by part (iii) of Corollary 3.1 and Theorem VI.4 of Flajolet and Sedgewick [5], the sequence geometrically decays with ratio as tends to infinity and we obtain .
(3) . This case is symmetrical to the previous case.
(4) . Set (). By Proposition 3.2, . We have and . Hence, in a manner similar to that used in part (2) above, we see that the sequence geometrically decays with ratio as tends to infinity and obtain . ∎
3.3 In the case of general direction vector
Letting be a direction vector, we obtain the asymptotic rate . For the purpose, we consider the -block state process derived from the original 2d-QBD process, , whose state space is . Since the state of corresponds to the state of the original 2d-QBD process, we have for any that
(3.42) |
where is the stationary distribution of . Therefore, applying the results of the previous subsection to , we can obtain .
Denote by the matrix generating function of the transition probability blocks of , corresponding to of the original 2d-QBD process (see Appendix A). The simultaneous equations corresponding to (3.34) are given by
(3.43) |
Since we have by Proposition 4.2 of Ozawa [24] that
(3.44) |
simultaneous equations (3.43) are equivalent to
(3.45) |
For , let and be the two real roots of simultaneous equations (3.45), counting multiplicity, where and . Redefine real values and as
(3.46) | |||
(3.47) |
which are equivalent to definitions (1.4). Since the block state process is derived from the original 2d-QBD process, the former inherits all assumptions for the latter, including Assumption 3.1. Hence, by Theorem 3.1, we immediately obtain the following.
Theorem 3.2.
For any direction vector , , and if , the sequence geometrically decays with ratio as tends to infinity, i.e., for some constant vector ,
4 Geometric property and an example
4.1 The value of the asymptotic rare
Geometric consideration (see, for example, Miyazawa [13]) is also useful in our case. Here we reconsider Theorem 3.2 geometrically. Define two points and as and , respectively. For the definition of and , see (3.21), and for the definition of and , see Appendix A. Using these points, we define the following classification (see Fig. 6).
-
Type 1: and ,
Type 2: and ,
Type 3: and ,
Type 4: and .
Let be an arbitrary direction vector. For , satisfies . Hence, by (1.4), we have, for ,
(4.1) |
From this representation for , we see that the asymptotic decay rate in direction is given depending on the geometrical relation between and , as follows (see Figs. 5 and 6).

-
•
Type 1. If , then , where ; If , then , where ; Otherwise (i.e., ), .
-
•
Type 2. If , then ; Otherwise (i.e., , .
-
•
Type 3. .
-
•
Type 4. .
This also holds for the case where or .
4.2 An example
We consider the same queueing model as that used in Ozawa and Kobayashi [22]. It is a single-server two-queue model in which the server visits the queues alternatively, serves one queue (queue 1) according to a 1-limited service and the other queue (queue 2) according to an exhaustive-type -limited service (see Fig. 7). Customers arrive at queue 1 (resp. queue 2) according to a Poisson process with intensity (resp. ). Service times are exponentially distributed with mean in queue 1 ( in queue 2). The arrival processes and service times are mutually independent. We refer to this model as a -limited service model. In this model, the asymptotic decay rate indicates how the joint queue length probability in steady state decreases as the queue lengths of queue 1 and queue 2 simultaneously enlarge.


, , , , , ,

, , , , , ,
Let be the number of customers in queue 1 at time , that of customers in queue 2 and the server state. When , takes one of the states in at random; When and , it also takes one of the states in at random; When and , it takes the state of or at random if the server is serving the -th customer in queue 2 during a visit of the server at queue 2 and takes the state of if the server is serving the -th customer in queue 2; When and , it takes the state of if the server is serving a customer in queue 1 and takes the state of if the server is serving the -th customer in queue 2 during a visit of the server at queue 2. The process becomes a continuous-time 2d-QBD process on the state space . By uniformization with parameter , we obtain the corresponding discrete-time 2d-QBD process, . For the description of the transition probability blocks such as , see Ref. [22]. This -limited service model satisfies Assumptions 1.1, 1.2, 2.2 and 3.1.
In numerical experiments, we treat two cases: a symmetric parameter case (see Fig. 8 and Table 1) and an asymmetric parameter case (see Fig. 9 and Table 2). In both the cases, the value of is set at , or . In Figs. 8 and 9, the closed curves of are drawn with points and . Define points , and as , and , respectively. For the definition of and , see Appendix A. These points are also written on the figures. From the figures, we see that all the cases are classified into Type 1. If and (see Fig. 8 (a), (b) and Fig. 9 (b)), then, for any , is given by . On the other hand, in the symmetric case of (see Fig. 8 (c)), is given by only if ; In the asymmetric case of (see Fig. 9 (a)), it is given by only if ; In that of (see Fig. 9 (c)), it is given by only if . Tables 1 and 2 shows the normalized values of , i.e., , where . From the tables, it can be seen how the values of the asymptotic decay rate vary according to the direction vector.
5 Concluding remark
The large deviation techniques are often used for investigating asymptotics of the stationary distributions in Markov processes on the positive quadrant (see, for example, Miyazawa [13] and references therein). In analysis using them, the upper and lower bounds for the asymptotic decay rates are represented in terms of the large deviation rate function, and that rate function is given by the variational problem minimizing the total variances of the critical path. Set , and . The following three kinds of path of point moving from the origin to a positive point are often used as options for the critical path (see, for example, Dai and Miyazawa [3] in the case of SRBM).
-
•
Type-0 path: directly moves from the origin to through .
-
•
Type-1 path: First, moves from the origin to some point on through and then it moves to through .
-
•
Type-2 path: Replace with in the definition of Type-1 path.
In our analysis, the generating function has been divided into three parts: , and , through compensation equation (2.13). In some sense, evaluates Type-0 paths and “” corresponds to the case where the critical path is of Type-0; evaluates Type-1 paths and “” corresponds to the case where the critical path is of Type-1; evaluates Type-2 paths and “” corresponds to the case where the critical path is of Type-2. This analogy gives us some insight to investigate asymptotics of the stationary tail distributions in higher-dimensional QBD processes. For related topics with respect to queueing networks, see Foley and McDonald [6], where paths called jitter, bridge and cascade ones are considered. Type-0 paths above correspond to jitter ones, and Type-1 and Type-2 paths to cascade ones.
References
- [1] Bini, D.A., Latouche, G. and Meini, B., Numerical Solution of Structured Markov Chains, Oxford University Press, Oxford (2005).
- [2] Borovkov, A.A. and Mogul’skiĭ, A.A., Large deviations for Markov chains in the positive quadrant, Russian Mathematical Surveys 56 (2001), 803–916.
- [3] Dai, J.G. and Miyazawa, M., Stationary distribution of a two-dimensional SRBM: geometric views and boundary measures, Queueing Systems 74 (2013), 181–217.
- [4] Fayolle, G., Malyshev, V.A. and Menshikov, M.V., Topics in the Constructive Theory of Countable Markov Chains, Cambridge University Press, Cambridge (1995).
- [5] Flajolet, P. and Sedgewick, R., Analytic Combinatorics, Cambridge University Press, Cambridge (2009).
- [6] Foley, R.D. and McDonald, D.R., Large deviations of a modified Jackson network: Stability and rough asymptotics, The Annals of Applied Probability 15(1B) (2005), 519–541.
- [7] Horn, R.A. and Johnson, C.R., Topics in Matrix Analysis, Cambridge University Press, Cambridge (1991).
- [8] Keilson, J., Markov Chain Models – Rarity and Exponentiality, Springer-Verlag, New York (1979).
- [9] Kobayashi, M. and Miyazawa, M., Revisit to the tail asymptotics of the double QBD process: Refinement and complete solutions for the coordinate and diagonal directions, Matrix-Analytic Methods in Stochastic Models (2013), 145-185.
- [10] Latouche, G. and Ramaswami, V., Introduction to Matrix Analytic Methods in Stochastic Modeling, SIAM, Philadelphia (1999).
- [11] Markushevich, A.I., Theory of Functions of a Complex Variable, AMS Chelsea Publishing, Providence (2005).
- [12] Miyazawa, M., Tail decay rates in double QBD processes and related reflected random walks, Mathematics of Operations Research 34(3) (2009), 547–575.
- [13] Miyazawa, M., Light tail asymptotics in multidimensional reflecting processes for queueing networks, TOP 19(2) (2011), 233–299.
- [14] Miyazawa, M., Superharmonic vector for a nonnegative matrix with QBD block structure and its application to a Markov modulated two dimensional reflecting process, Queueing Systems 81 (2015), 1–48.
- [15] Miyazawa, M., Markov modulated fluid network process: Tail asymptotics of the stationary distribution, Stochastic Models 37 (2021), 127–167.
- [16] Neuts, M.F., Matrix-Geometric Solutions in Stochastic Models, Dover Publications, New York (1994).
- [17] Neuts, M.F., Structured stochastic matrices of M/G/1 type and their applications, Marcel Dekker, New York (1989).
- [18] Ney, P. and Nummelin, E., Markov additive processes I. Eigenvalue properties and limit theorems, The Annals of Probability 15(2) (1987), 561–592.
- [19] Nummelin, E., General Irreducible Markov Chains and Non-negative Operators, Cambridge University Press, Cambridge (1984).
- [20] Ozawa, T., Asymptotics for the stationary distribution in a discrete-time two-dimensional quasi-birth-and-death process, Queueing Systems 74 (2013), 109–149.
- [21] Ozawa, T. and Kobayashi, M., Exact asymptotic formulae of the stationary distribution of a discrete-time two-dimensional QBD process, Queueing Systems 90 (2018), 351-403.
- [22] Ozawa, T. and Kobayashi, M.: Exact asymptotic formulae of the stationary distribution of a discrete-time 2d-QBD process: an example and additional proofs, arXiv:1805.04802 (2018).
- [23] Ozawa, T., Stability condition of a two-dimensional QBD process and its application to estimation of efficiency for two-queue models, Performance Evaluation 130 (2019), 101–118.
- [24] Ozawa, T., Asymptotic properties of the occupation measure in a multidimensional skip-free Markov modulated random walk, Queueing Systems 97 (2021), 125–161.
Appendix A Asymptotic properties of the block state process
For , let be the -block state process derived from a 2d-QBD process , introduced in Subsection 2.4. Since the -block state process is also a 2d-QBD process, we obtain by the results of Refs. [20, 21, 24] the following.
Define vector generating functions and as

Define a matrix function as
and a domain as
By Lemma A.1 of Ozawa [24], is log-convex in , and the closure of is a convex set. Define the extreme values of , and for , as
(A.1) |
For , let and be the real two roots to equation
(A.2) |
counting multiplicity, where (see Fig. 10). For , and are analogously defined. Hereafter, if , we omit the left superscript ; for example, is denoted by and by ( and have already been defined in Section 1). By Proposition 4.2 of Ozawa [24], we have
(A.3) |
This implies that, for example, and .
For and , define matrix functions , , and as
For and , analogously define matrix functions , , and . For and , let and be the minimum nonnegative solutions to quadratic matrix equations (A.4) and (A.5), respectively:
(A.4) | |||
(A.5) |
where and are called G-matrices in the queueing theory. By Lemma 2.5 of Ozawa [24], we have
(A.6) |
Define matrix functions and as
and, for , a real value as
Define real values and as
Note that if , then, for , inequality is equivalent to (for the definition of , see Section 1). Hence, for , defined in Section 1 satisfies
(A.7) |
Furthermore, for ,
(A.8) |
By Lemma 2.6 of Ozawa and Kobayashi [21], we have the following.
Lemma A.1.
The asymptotic decay rates and are given by
(A.9) |
Appendix B Proof of Proposition 2.3
Proof of Proposition 2.3.
For a sequence , we denote by the partial sum of the sequence defined as . Let be a vector of positive integers. Let and be arbitrary states in such that . Since the induced MA-process is irreducible, there exist a , and sequence such that and for every integer , and
Such a sequence gives a path from to on , and that path is also a path from to in the original 2d-QBD process . For , let be the first hitting time to the state in , i.e., , and denote by the occupation measure defined as
Then, we have
(B.1) |
Due to the space homogeneity of with respect to the additive part, for every , there exists a path from to given by the same sequence as mentioned above, and it is also a path from to in the original 2d-QBD process. Hence, we have and obtain
(B.2) |
where does not depend on . This leads us to and . Interchanging with , we analogously obtain and . This completes the proof. ∎