Asymptotic property of the occupation measures in a two-dimensional skip-free Markov modulated random walk
Abstract
We consider a discrete-time two-dimensional process on with a background process on a finite set , where individual processes and are both skip free. We assume that the joint process is Markovian and that the transition probabilities of the two-dimensional process vary according to the state of the background process . This modulation is assumed to be space homogeneous. We refer to this process as a two-dimensional skip-free Markov modulate random walk. For , consider the process starting from the state and let be the expected number of visits to the state before the process leaves the nonnegative area for the first time. For , the measure is called an occupation measure. Our main aim is to obtain asymptotic decay rate of the occupation measure as the values of and go to infinity in a given direction. We also obtain the convergence domain of the matrix moment generating function of the occupation measures.
Key wards: Markov modulated random walk, Markov additive process, occupation measure, asymptotic decay rate, moment generating function, convergence domain
Mathematics Subject Classification: 60J10, 60K25
1 Introduction
We consider a discrete-time two-dimensional process on , where is the set of all integers, and a background process on a finite set , where is the cardinality of . We assume that individual processes and are both skip free, which means that their increments take values in . Furthermore, we assume that the joint process is Markovian and that the transition probabilities of the two-dimensional process vary according to the state of the background process . This modulation is assumed to be space homogeneous. We refer to this process as a two-dimensional skip-free Markov modulate random walk (2d-MMRW for short). The state space of the 2d-MMRW is given by . The 2d-MMRW is a two-dimensional Markov additive process (2d-MA-process for short) [6], where is the additive part and the background state. A discrete-time two-dimensional quasi-birth-and-death process [9] (2d-QBD process for short) is a 2d-MMRW with reflecting boundaries on the and -axes, where the process is the level and the phase. 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 continuous-time 2d-QBD processes (see, for example, [7] and [9, 10, 11]) and, by using the uniformization technique, they can be deduced to discrete-time 2d-QBD processes. In that sense, (discrete-time) 2d-QBD processes are more versatile than two-dimensional skip-free reflecting random walks (2d-RRWs for short), which are 2d-QBD processes without a phase process and called double QBD processes in [4]. It is well known that, in general, the stationary distribution of a Markov chain can be represented in terms of its stationary probabilities on some boundary faces and its occupation measures. In the case of a 2d-QBD process, such occupation measures are given as those of the corresponding 2d-MMRW. For this reason, we focus on 2d-MMRWs and study their occupation measures, especially, asymptotic properties of the occupation measures. Here we briefly explain that the assumption of skip-free is not so restricted. For a given , assume that the increments of and take values in . For , let and be the quotient and remainder of divided by , respectively, where and . Then, the process becomes a 2d-MMRW with skip-free jumps, where is the level and the background state. Hence, any 2d-MMRW with bounded jumps can be reduced to a 2d-MMRW with skip-free jumps.
Let be the transition probability matrix of the 2d-MMRW , where . By the property of skip-free, each element of , say , is nonzero only if and . By the property of space-homogeneity, for , and , we have . Hence, the transition probability matrix can be represented as a block matrix in terms of only the following blocks:
i.e., for , block is given as
(1.1) |
where is a matrix of 0’s whose dimension is determined in context. Define a set as , where is the set of all nonnegative integers, and let be the stopping time at which the 2d-MMRW enters for the first time, i.e.,
For , let be the expected number of visits to the state before the process starting from the state enters for the first time, i.e.,
(1.2) |
where is an indicator function. For , the measure is called an occupation measure. Note that is the -element of the fundamental matrix of a truncated substochastic matrix given as , i.e., and
where, for example, is defined by . governs transitions of on the positive quarter-plane. Our main aim is to obtain the asymptotic decay rate of the occupation measure as the values of and go to infinity in a given direction. This asymptotic decay rate gives a lower bound for the asymptotic decay rate of the stationary distribution in the corresponding 2d-QBD process in the same direction. Such lower bounds have been obtained for some kinds of multi-dimensional reflected process without background states; for example, two-dimensional -partially chains in [1], also see comments on Conjecture 5.1 in [6]. With respect to multi-dimensional reflected processes with background states, such asymptotic decay rates of the stationary tail distributions in two-dimensional reflected processes have been discussed in [6, 7] by using Markov additive processes and large deviations, but some results seem to be halfway and, in addition, the methods used in those papers are different from ours; we use matrix analytic methods and complex analytic methods. Note that the asymptotic decay rates of the stationary distribution in a 2d-QBD process in the coordinate directions have been obtained in [9, 10].
As mentioned above, the 2d-MMRW is a 2d-MA-process, where the set of blocks, , corresponds to the kernel of the 2d-MA-process. Let be the matrix moment generating function of one-step transition probabilities defined as
is the Feynman-Kac operator [8] for the 2d-MA-process. For , define an matrix as and as . In terms of , is represented as . For , let be the matrix moment generating function of the occupation measures defined as
For , define the convergence domain of as
Define point sets and as
where is the spectral radius of . In the following sections, we will prove that, for any vector of positive integers and for every ,
where is the inner product of vectors and . Furthermore, using this asymptotic property, we will also demonstrate that, for any , is given by .
The rest of the paper is organized as follows. In Sect. 2, we present some assumptions and basic properties of the 2d-MMRW. In Sect. 3, we introduce three kinds of one-dimensional QBD process with countably many phases and obtain the convergence parameters of the rate matrices in the one-dimensional QBD processes. In Sect. 4, we consider the matrix generating functions of the occupation measures and demonstrate that the convergence domain of contains . Sect. 5 is a main section, where the asymptotic decay rates of the occupation measures and the convergence domain of are obtained. The paper concludes with remarks on the asymptotic property of 2d-QBD processes in Section 6.
Notation for matrices. For a matrix , we denote by the -element of . The convergence parameter of a square matrix with a finite or countable dimension is denoted by , i.e., . For a finite-dimensional square matrix , we denote by the spectral radius of , which is the maximum modulus of eigenvalue of . If a square matrix is finite and nonnegative, we have . The determinant of a square matrix is denoted by and the adjugate matrix by .
2 Preliminaries
We give some assumptions and propositions, which will be necessary in the following sections. First, we assume the following condition.
Assumption 2.1.
The 2d-MMRW is irreducible and aperiodic.
Under this assumption, for any , is also irreducible and aperiodic. Denote by and define the following matrices: for ,
is the transition probability matrix of the background process . Since is finite and irreducible, it is positive recurrent. Denote by the stationary distribution of . Define the mean increment vector of the process , denoted by , as follows.
(2.1) |
where is a column vector of 1’s whose dimension is determined in context. With respect to the occupation measures defined in Sect. 1, the following property holds.
Proposition 2.1.
If or , then, for any , the occupation measure is finite, i.e.,
(2.2) |
where is the stopping time at which enters for the first time.
Proof.
Without loss of generality, we assume . Let be the stopping time at which becomes less than 0 for the first time, i.e., . Since , we have , and this implies that, for any ,
(2.3) |
Next, we demonstrate that is finite. Consider a one-dimensional QBD process on , having , and as the transition probability blocks that govern transitions of the QBD process when . We assume the transition probability blocks that govern transitions of the QBD process when are given appropriately. Then, is the mean increment of the QBD process when and the assumption of implies that the QBD process is positive recurrent. Define a stopping time as . We have, for any ,
(2.4) |
and this completes the proof. ∎
Hereafter, we assume the following condition.
Assumption 2.2.
or .
Let be the maximum eigenvalue of . Since is nonnegative, irreducible and aperiodic, is the Perron-Frobenius eigenvalue of , i.e., . The modulus of every eigenvalue of except is strictly less than . We say that a positive function is log-convex in if is convex in . A log-convex function is also a convex function. With respect to , the following property holds.
Proposition 2.2 (Proposition 3.1 of [9]).
is log-convex and hence convex in .
Let be the closure of , i.e., . By Proposition 2.2, is a convex set. Furthermore, the following property holds.
Proposition 2.3 (Lemma 2.2 of [10]).
is bounded.
For , we give an asymptotic inequality for the occupation measure . Under Assumption 2.2, the occupation measure is finite and becomes a probability measure. Let be a random vector subject to the probability measure, i.e., for . By Markov’s inequality, for and for such that , where is a vector of 0’s whose dimension is determined in context, we have
This implies that, for every ,
(2.5) |
where is the largest integer less than or equal to . Hence, considering the convergence domain of ,we immediately obtain the following basic inequality.
Proposition 2.4.
For any such that and for every , and ,
(2.6) |
3 QBD representations with a countable phase space
In order to analyze the occupation measures, we introduce three kinds of one-dimensional QBD process with countably many phases. Let be a 2d-MMRW and be the stopping time defined in Sect. 1, i.e., . Using , we define a process as
where . The process is an absorbing Markov chain on the state space , where the set of absorbing states is given by . Hereafter, we restrict the state space of to , where the transition probability matrix of the process is given by . We assume the following condition through the paper.
Assumption 3.1.
is irreducible.
Under this assumption, is irreducible regardless of Assumption 2.1 and every element of is positive. We consider three kinds of QBD representation for : the first is , where is the level and is the phase, the second , where is the level and is the phase, and the third
where is the level and is the phase. The state spaces of and are given by and that of by . On the state space , the -th level set of is given by
and the level sets satisfy, for , . It can, therefore, be said that is a QBD process with level direction vector . Note that the QBD process is constructed according to Example 4.2 of [6]. For , the transition probability matrix of is given in block tri-diagonal form as
(3.1) |
where for ,
and
For , let be the rate matrix generated from the triplet , which is the minimal nonnegative solution to the matrix quadratic equation:
(3.2) |
We give , the convergence parameter of . For , define a matrix function as
(3.3) |
Since is irreducible and the number of positive elements of each row and column of is finite, we have, by Lemma 2.5 of [12],
(3.4) |
For and for , define matrix functions and as
The matrix function has been already defined in Sect. 1. Note that the point set is given as and it is a closed convex set. For , we define three points on the boundary of as
The matrix function and are given in block tri-diagonal form as
Since and are irreducible, we obtain, by Lemma 2.6 of [12],
and this with (3.4) leads us to the following proposition.
Proposition 3.1.
(3.5) |
For , we give an upper bound of . is given in block quintuple-diagonal form as
where
and
For , define a matrix function as
and consider a partial matrix of , denoted by , given as
which satisfies . Since is a block quintuple-diagonal matrix, we have, by Remark 2.5 of [12], and this implies
(3.6) |
On the other hand, we have
(3.7) | |||
(3.8) | |||
(3.9) | |||
(3.10) |
and this implies
(3.11) | |||
(3.12) | |||
(3.13) |
Hence, we obtain the following proposition.
Proposition 3.2.
(3.14) |
4 Convergence domain of the moment generating functions
In this section, we prove that, for any , the convergence domain of the matrix moment generating function includes the point set . For the purpose, we introduce generating functions of the occupation measures since, in analysis of convergence domain, they are more convenient than the moment generating functions.
4.1 Matrix generating functions of the occupation measures
Recall that is the fundamental matrix of the substochastic matrix and each row of is an occupation measure. Furthermore, is represented in block form as , and and are given as and , respectively.
For , let be the matrix generating function of the occupation measures defined as
In terms of , the matrix moment generating function defined in Sect. 1 is given as . The matrix generating function satisfies
(4.1) |
where
Define the following matrix functions:
where . Under Assumption 2.2, the summation of each row of is finite and we obtain . This leads us to the following recursive formula for :
(4.2) |
Considering the block structure of , we obtain, for , the recursive formula for :
(4.3) |
and this leads us to
(4.4) | ||||
(4.5) |
Combining this equation with (4.1), we obtain
(4.6) | |||
(4.7) |
This equation will become a clue for investigating the convergence domain.
4.2 Radii of convergence of and
For , and , define generating functions and as
and denote by and the radii of convergence of them, respectively, i.e.,
We have
and hence, in order to know the radii of convergence of and , it suffices to obtain and for . For the purpose, we present a couple of propositions.
Proposition 4.1.
For every , and , we have and .
Proof.
Recall that, for , is given by
where is the stopping time defined as . For any , since is irreducible, there exists such that . Using this , we obtain
(4.8) | ||||
(4.9) |
and this implies that . Exchanging with , we also obtain , and this leads us to . The other equation can analogously be obtained. ∎
Next, we consider the matrix generating functions in matrix geometric form corresponding to and . For , define matrices and and matrix generating functions and as
Further define and as
From (4.2), we obtain, for ,
(4.10) |
where and is given by (3.1). This leads us to, for ,
(4.11) |
and we obtain, for ,
(4.12) | |||
(4.13) |
The solution to equation (4.13) is given as
(4.14) |
where we use the fact that since is finite. From (4.14) and Fubini’s theorem, we obtain
(4.15) |
This leads us to the following proposition.
Proposition 4.2.
There exist some states and in such that, for every and , and .
Proof.
Define as . Recall that the -element of is . Furthermore, is irreducible and every element of is positive. Hence, by (4.15), we have
(4.16) |
and this implies that, for every and every , . On the other hand, we have and, by Fubini’s theorem,
(4.17) |
Since is a block tri-diagonal matrix and the size of each block is finite, the number of positive elements in each row of is finite. Since is irreducible, at least one element of , say the -element, is positive. Hence, we have, for every and ,
(4.18) |
and this implies that . As a result, we obtain, for some and and for every and , .
Analogously, we obtain, for some and and for every and , . ∎
Lemma 4.1.
For every and for every and , we have and . Hence, for every , the radius of convergence of is given by and that of by .
4.3 Radius of convergence of another matrix generating function
In the previous subsection, we defined the matrix generating functions of the occupation measures in matrix geometric form corresponding to and . In this subsection, we consider that corresponding to . For , define as
Then, in a manner similar to that used for deriving (4.14), we obtain
(4.19) |
Define a matrix generating function as
For and , let be the -element of and denote by the radius of convergence of . In terms of , is given as
(4.20) |
where and . We have the following property of , which corresponds to Lemma 4.1.
Lemma 4.2.
For every and , we have . Hence, the radius of convergence of is given by .
4.4 Convergence domain of
Recall that, for , the convergence domain of the matrix moment generating function is given as . This domain does not depend on .
Proposition 4.3.
For every , .
Proof.
For every and , since is irreducible, there exists such that . Using this and inequality (4.9), we obtain, for every and ,
(4.21) | ||||
(4.22) | ||||
(4.23) |
and this implies . Exchanging with , we obtain , and this completes the proof. ∎
A relation between the point sets and is given as follows.
Lemma 4.3.
For every , and hence, .
We use complex analytic methods for proving this lemma. Letting and be complex variables, we define complex matrix functions , , , , , , and in the same manner as that used in the case of real variable. They satisfy equation (4.1). For , denote by , and the open disk, closed disk and circle of center and radius on the complex plane, respectively. Since every element of is nonnegative, we immediately obtain, by Lemma 4.1, the following proposition.
Proposition 4.4.
Under Assumption 3.1, for every , is element-wise analytic in and is element-wise analytic in .
Recall that the matrix generating function is the function of two variables defined by the power series
(4.24) |
which is also the Taylor series for the function at . Since , we use power series (4.24) for proving Lemma 4.3. Under Assumption 2.2, since , power series (4.24) converges absolutely on and is analytic in . Lemma 4.3 asserts that, for every , power series (4.24) converges absolutely in , and to prove it, it suffices to show that, every , power series (4.24) converges at since any coefficient in the power series is nonnegative. Define a matrix function as , where
(4.25) | ||||
(4.26) | ||||
(4.27) |
Note that the inverse of is given by . The function is analytic in and, by Proposition 4.4, each element of is analytic in . For , since power series (4.24) is absolutely convergent, equation (4.7) holds and we have . Hence, by the identity theorem, we see that is an analytic extension of . Hereafter, we denote the analytic extension by the same notation . In the proof of Lemma 4.3, we use the following proposition.

Proof of Lemma 4.3.
By Lemma 4.1, the radius of convergence of is and that of is . Since we have, for every , and , both and converge absolutely at every . Hence, from (4.1), we see that, in order to prove the lemma, it suffices to show that, for every , power series (4.24) converges at . We demonstrate it.
Under Assumption 2.2, either or is negative. Here, we assume ; the proof for the case where is analogous. By Lemma 2.3 of [10], we have , where , and this implies that includes open interval on the complex plain, where is the value of that satisfies (see Fig. 1). Let be an arbitrary point in and consider a path on connecting different points , , and by lines in this order, where we assume (see Fig. 1). It is always possible since the closure of , , is a closed convex set.
First, we consider a matrix function of one variable given by . The Taylor series for at is given by power series (4.24), where is set at , and is identical to on a domain where is well defined. Let be a sufficiently small positive number. Since and each element of are analytic as a function of one variable in , is meromorphic as a function of one variable in that domain. We have, for , , and by Proposition 4.5, we have, for , . Hence, for any , and each element of is analytic on . Furthermore, we have , and this implies that the point is not a pole of any element of ; hence, it is a removable singularity. From this and the fact that is analytic in , we see that is analytic in . This implies that the radius of convergence of the Taylor series for at is greater than , and power series (4.24) converges at .
Next, we consider a matrix function of one variable given by . By the fact obtained above, the Taylor series for at is given by power series (4.24), where is set at , and is analytic as a function of one variable in . Furthermore, we know that is identical to on a domain where is well defined. If , then it is obvious that power series (4.24) converges at . Therefore, we assume . Let be a sufficiently small positive number. For , we have . Hence, for the same reason used in the case of , we see that is analytic in , and this implies that is analytic in . Hence, the radius of convergence of the Taylor series for at is greater than , and power series (4.24) converges at . Applying a similar procedure to the matrix function , we see that power series (4.24) converges at , and this completes the proof. ∎
In the following section, we will prove that holds for every (see Corollary 5.1).
5 Asymptotics of the occupation measures
5.1 Asymptotic decay rate in an arbitrary direction
By Lemma 4.1 and the Cauchy-Hadamard theorem, we have, for every and ,
(5.1) | |||
(5.2) |
Furthermore, by (4.14) and Corollary 2.1 of [12], “” in equations (5.1) and (5.2) can be replaced with “”. The following results are inferred from these equations.
Theorem 5.1.
For any vector of positive integers, for every such that or , for every such that or and for every ,
(5.3) |
In order to prove this theorem, we introduce another representation of the 2d-MMRW . Let be a vector of positive integers. For , denote by and the quotient and remainder of divided by , respectively, i.e.,
where and . Define a process as , where . The process is a 2d-MMRW with background process and its state space is given by , where, for such that , we denote by the set of integers from through , i.e., . The transition probability matrix of , denoted by , has a double-tridiagonal block structure like . Denote by , the nonzero blocks of . For a positive integer and for , define a matrix as
Define the following block matrices: for ,
where is the Kronecker product operator. Each block is a block matrix and they are given as follows: for ,
Define a matrix function as
The following relation holds between and .
Proposition 5.1.
For any vector of positive integers, we have
(5.4) |
Since the proof of this proposition is elementary, we give it in Appendix A.
Proof of Theorem 5.1.
In order to obtain the lower bounds, define a process as , where is the stopping time given as . According to considered in Sect. 3, define a process as
The process is a QBD process with countably many phases, where is the level and is the phase. Let be the rate matrix of . By Propositions 3.2 and 5.1, we have
(5.6) | ||||
(5.7) | ||||
(5.8) |
For some and for any , we have, by Corollary 2.1 of [12],
(5.9) |
If , then the state corresponds to the state . Hence, from (4.19), setting and , we obtain, for every such that or and for every ,
(5.10) |
Analogously, if , then setting and , we obtain, for every such that or and for every ,
(5.11) |
From (5.10), (5.11) and (5.8), we obtain the desired lower bound as follows: for every such that or , for every such that or and for every ,
(5.12) |
This completes the proof. ∎
Corollary 5.1.
For every , .
In order to prove the corollary, we introduce some notation. Recall that, by Propositions 2.2 and 2.3, the point set is a closed convex set and bounded. For , define a point as . We have already defined and . For a given , equation has just two different real solutions: , where . The function is monotonically decreasing in . Further define the following domains:

Proof of Corollary 5.1.
We prove , where . By Proposition 4.3, this implies for every . Regarding and as functions of two variables and , we see, by Lemma 4.1, that the convergence domain of is given by and that of by . From (4.1), we, therefore, obtain . On the other hand, by Lemma 4.3, we have . Hence, in order to prove , it suffices to demonstrate that (see Fig. 2).
Let be a vector of positive integers. Define a point as
The point is represented as and satisfies
Hence, we obtain . Since monotonically decreases from to when increases from to , we see that the point set is dense in the curve . For , define a moment generating function as
(5.13) |
By Theorem 5.1 and the Cauchy-Hadamard theorem, we see that the radius of convergence of the power series in the right hand side of (5.13) is and this implies that diverges if and . From the definition of , we obtain
(5.14) |
Here, we suppose . Since is an open set, there exists a point , where is the closure of . We have . On the other hand, from the definition of , there exists a such that and , and such can be taken in the point set since is dense in . Hence, we have , and this contradicts finiteness of . As a result, we have and this completes the proof. ∎
5.2 Asymptotic decay rates of marginal measures
Let be a vector of random variables subject to the stationary distribution of a two-dimensional reflecting random walk. The asymptotic decay rate of the marginal tail distribution in a form has been considered in [5] (also see [3]), where is a direction vector. In this subsection, we consider this type of asymptotic decay rate for the occupation measures.
Let and be mutually prime positive integers. We assume ; in the case of , an analogous result can be obtained. For , define an index set as
For , the matrix moment generating function is represented as
(5.15) |
By the Cauchy-Hadamard theorem, we obtain the following theorem.
Theorem 5.2.
For any mutually prime positive integers and such that and for every and ,
(5.16) |
In the case where , an analogous result holds.
6 Concluding remarks
Using our results, we can obtain a lower bound for the asymptotic decay rate of the stationary distribution in a 2d-QBD process. Let be a 2d-QBD process on state space and assume that the blocks of transition probabilities when and are given by . Assume that is irreducible, aperiodic and positive recurrent and denote by the stationary distribution of the 2d-QBD process. Further assume that the blocks satisfy the property corresponding to Assumptions 2.1 and 3.1. For and , we have
(6.1) | ||||
(6.2) | ||||
(6.3) | ||||
(6.4) | ||||
(6.5) |
where, for , and is an element of the occupation measures in the corresponding 2d-MMRW, defined by (1.2). By (6.5) and Theorem 5.1, for any vector of positive integers and for every , a lower bound for the asymptotic decay rate of the stationary distribution in the 2d-QBD process in the direction specified by is given as follows:
(6.6) |
where . Note that an upper bound for the asymptotic decay rate can be obtained by using the convergence domain of the matrix moment generating function for the stationary distribution and an inequality corresponding to (2.6). The convergence domain can be determined by Lemma 3.1 of [10] and Corollary 5.1.
References
- [1] Borovkov, A.A. and Mogul’skiĭ, A.A., Large deviations for Markov chains in the positive quadrant, Russian Mathematical Surveys 56 (2001), 803–916.
- [2] Fayolle, G., Malyshev, V.A., and Menshikov, M.V. (1995). Topics in the Constructive Theory of Countable Markov Chains. Cambridge University Press, Cambridge.
- [3] Kobayashi, M. and Miyazawa, M., Tail asymptotics of the stationary distribution of a two-dimensional reflecting random walk with unbounded upward jumps, Adv. Appl. Prob. 46 (2014) 365-399.
- [4] Miyazawa, M., Tail decay rates in double QBD processes and related reflected random walks, Mathematics of Operations Research 34(3) (2009), 547–575.
- [5] Miyazawa, M., Light tail asymptotics in multidimensional reflecting processes for queueing networks, TOP 19(2) (2011), 233–299.
- [6] Miyazawa, M. and Zwart, B., Wiener-Hopf factorizations for a multidimensional Markov additive process and their applications to reflected processes, Stochastic Systems 2(1)(2012), 67–114.
- [7] 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, 1–48 (2015).
- [8] P. Ney and E. Nummelin, Markov additive processes I. Eigenvalue properties and limit theorems. The Annals of Probability 15(2) (1987), 561–592.
- [9] Ozawa, T., Asymptotics for the stationary distribution in a discrete-time two-dimensional quasi-birth-and-death process, Queueing Systems 74 (2013), 109–149.
- [10] 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.
- [11] 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.
- [12] Ozawa, T., Convergence parameters of nonnegative block tri-diagonal matrices and their application to multi-dimensional QBD processes, working paper (2019). arXiv: 1611.02434
- [13] Seneta, E., Non-negative Matrices and Markov Chains, revised printing, Springer-Verlag, New York (2006).
Appendix A Proof of Proposition 5.1
We use the following proposition for proving Proposition 5.1.
Proposition A.1.
Let , and be nonnegative matrices, where can be countably infinite, and define a matrix function as
(A.1) |
Assume that, for any , is finite and is irreducible. Let be a positive integer and define a block matrix as
(A.2) |
Then, we have .
Proof.
First, assume that, for a positive number and a measure , , and define a measure as
Then, we have and, by Theorem 6.3 of [13], we obtain .
Next, assume that, for a positive number and a measure , , and define a measure as
Further, define a nonnegative matrix as
Then, we have and . Hence, we have and this implies . ∎