A system of nonlinear equations with application to large deviations for Markov chains with finite lifetime
Ze-Chun Hu, Wei Sun, Jing Zhang

TL;DR
This paper proves the existence of solutions to a complex nonlinear system and applies this to establish a large deviation principle for occupation times in finite lifetime Markov chains.
Contribution
It introduces a novel existence result for a class of nonlinear equations and applies it to large deviations in Markov chain occupation times.
Findings
Existence of solutions to the nonlinear system for n ≥ 3.
Application to large deviation principles for Markov chains.
Insights into occupation time distributions with finite lifetime.
Abstract
In this paper, we first show the existence of solutions to the following system of nonlinear equations \begin{eqnarray*}\left\{\begin{array}{l} a_{11}x_1+a_{12}x_2+a_{13}x_3+\cdots+a_{1n}x_{n} = b_{11}\frac{1}{x_1}+b_{12}\frac{1}{x_2}+b_{13}\frac{1}{x_3}+\cdots+b_{1n}\frac{1}{x_{n}},\\ a_{21}\frac{1}{x_1}+a_{22}\frac{x_2}{x_1}+a_{23}\frac{x_3}{x_1}+\cdots+a_{2n}\frac{x_{n}}{x _1}=b_{21}x_1+b_{22}\frac{x_1}{x_2}+b_{23}\frac{x_1}{x_3}+\cdots+b_{2n}\frac{x_1}{x_{n}},\\ a_{31}\frac{x_1}{x_2}+a_{32}\frac{1}{x_2}+a_{33}\frac{x_3}{x_2}+\cdots+a_{3n}\frac{x_{n}}{x _2}=b_{31}\frac{x_2}{x_1}+b_{32}x_2+b_{33}\frac{x_2}{x_3}+\cdots+b_{3n}\frac{x_2}{x_{n}},\\ \cdots\cdots\\ a_{n1}\frac{x_1}{x_{n-1}}+a_{n2}\frac{x_2}{x_{n-1}}+a_{n3}\frac{x_3}{x_{n-1}}+ \cdots+a_{n,n-1}\frac{1}{x_{n-1}}+a_{nn}\frac{x_{n}}{x_{n-1}}\\…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsProtein Structure and Dynamics
A system of nonlinear equations with application to large deviations for Markov chains with finite lifetime
Ze-Chun Hu
College of Mathematics, Sichuan University, Chengdu, 610064, China
E-mail: [email protected]
Wei Sun
Department of Mathematics and Statistics, Concordia University,
Montreal, H3G 1M8, Canada
E-mail: [email protected]
Jing Zhang
School of Mathematics and Statistics, Hainan Normal University,
Haikou, 571158, China
E-mail: [email protected]
Abstract In this paper, we first show the existence of solutions to the following system of nonlinear equations
[TABLE]
where and , are positive constants. Then, we make use of this result to obtain the large deviation principle for the occupation time distributions of continuous-time finite state Markov chains with finite lifetime.
Keywords system of nonlinear equations, continuous-time Markov chain, finite lifetime, occupation time distribution, large deviation principle.
1 Introduction and main results
In a series of fundamental papers (see [1, 2, 3, 4]), Donsker and Varadhan developed the large deviation theory for the occupation time distributions of Markov processes. By virtue of Dirichlet forms, Fukushima and Takeda derived the Donsker-Varadhan type large deviation principle for a general, not necessarily conservative symmetric Markov processes (see [5], [6, Section 6.4] and the references therein). The motivation of this work is to generalize some results of Donsker-Varadhan and Fukushima-Takeda to not necessarily conservative and not necessarily symmetric Markov processes.
We denote for . Let be a continuous-time Markov chain with the state space . Denote by the lifetime of and denote by the -matrix of . We assume that satisfies the following conditions:
(1) .
(2) .
(3) .
In this paper, we will derive the large deviation principle for the occupation time distributions of .
We discover that the large deviations for rely heavily on the existence of solutions to the following system of nonlinear equations
[TABLE]
where and , are constants. It is a bit surprising to us that (1.8) turns out to be undiscussed to date. In the next section, we will prove the following result.
Theorem 1.1
Suppose that and , are positive constants. Then, there exists a positive solution to (1.8).
As a direct consequence of Theorem 1.1, we obtain the following result.
Theorem 1.2
Suppose that and . Then, there exist , such that
[TABLE]
The proof of Theorem 1.2 will be given in the next section.
Remark 1.3
(a) Denote by the diagonal matrix with , , if , and denote by . Hereafter T denotes transpose. Then, we can rewrite (1.9) as follows
[TABLE]
Theorem 1.2 implies that for any vector there exists a positive diagonal matrix such that (1.10) holds.
(b) If the matrix is symmetric, then it is easy to see that , provide a solution to (1.9). When is non-symmetric, Theorem 1.2 seems to be a new result in the literature.
In Section 3 of this paper, we will make use of Theorem 1.2 to obtain the large deviation principle for . Define the normalized occupation time distribution , , by
[TABLE]
Let be a function on . We write and denote if for each . For , we have . Let be a measure on . We define
[TABLE]
Denote by the set of all probability measures on .
Theorem 1.4
For each open set of ,
[TABLE]
For each closed set of ,
[TABLE]
By setting in Theorem 1.4, we get
Corollary 1.5
For ,
[TABLE]
2 Proofs of Theorems 1.1 and 1.2
Proof of Theorem 1.1.
We first consider the case that .
We define four continuous functions with the domain by
[TABLE]
It is easy to see that the function has a minimum value at some point . In the following, we will prove that
[TABLE]
Since has a minimum value at , we have
[TABLE]
where , are positive constants. If , then we obtain by (2.1) and (2.2) that . Similarly, if or , we also have
[TABLE]
Thus, to prove the existence of solutions to (1.8), we need only show that there is a contradiction if
[TABLE]
Suppose that (2.4) holds. If , then we obtain by (2.3) that either or . Further, we obtain by (2.1) and (2.2) that both and . Similarly, we can show that if , then and . Therefore, to prove the existence of solutions to (1.8), we need only show that neither of the following two cases can happen: Case (i). , and . **Case (ii). ** , and . Case (i) cannot happen. Suppose that
[TABLE]
In the following, we will show that there exist sufficiently small positive numbers and such that , , and
[TABLE]
Define , and
[TABLE]
Then, it is sufficient to show that there exists a positive number such that
[TABLE]
i.e.,
[TABLE]
Obviously, there exists a positive number satisfying all the above conditions. For this , we have that , which contradicts that reaches its minimum at . Case (ii) cannot happen. Suppose that
[TABLE]
In the following, we will show that there exist sufficiently small positive numbers and such that , and
[TABLE]
Define , and
[TABLE]
Then, it is sufficient to show that there exists a positive number such that
[TABLE]
i.e.,
[TABLE]
Obviously, there exists a positive number satisfying all the above conditions. For this , we have that , which contradicts that reaches its minimum at .
We now consider the general case that .
We define continuous functions with the domain by
[TABLE]
The function has a minimum value at some point . In the following, we will prove that
[TABLE]
Since has a minimum value at , we have
[TABLE]
It follows that
[TABLE]
where , are positive constants. Note that there is exactly one minus sign in the first equations and there is no minus sign in the last equation. Case (a). Suppose that . We consider the following continuous functions with the domain :
[TABLE]
Since has a minimum value at , has a minimum value at . Then, we have
[TABLE]
which together with implies that
[TABLE]
where , are positive constants. Thus, we obtain by following the same argument for the case that
[TABLE]
Therefore,
[TABLE]
Case (b). Suppose that . By symmetry, we can assume without loss of generality that . Now we consider the following continuous functions with the domain :
[TABLE]
Since has a minimum value at , has a minimum value at . Then, we have
[TABLE]
which together with implies that
[TABLE]
where , are positive constants. Thus, we obtain by following the same argument for the case that
[TABLE]
Therefore,
[TABLE]
Case (c). Suppose that . We will show that there is a contradiction. By symmetry, we need only consider four different subcases as follows. Case (c1). Suppose that
[TABLE]
Similar to the case that , we can find positive numbers such that
[TABLE]
and
[TABLE]
It follows that
[TABLE]
which contradicts that reaches its minimum at . Case (c2). Suppose that for ,
[TABLE]
We fix and . Similar to the case that , we can find positive numbers such that
[TABLE]
and
[TABLE]
It follows that
[TABLE]
which contradicts that reaches its minimum at . Case (c3). Suppose that
[TABLE]
Similar to the case that , we can find positive numbers such that
[TABLE]
and
[TABLE]
It follows that
[TABLE]
which contradicts that reaches its minimum at . Case (c4). Suppose that for ,
[TABLE]
We fix and . Similar to the case that , we can find positive numbers such that
[TABLE]
and
[TABLE]
It follows that
[TABLE]
which contradicts that reaches its minimum at .
Proof of Theorem 1.2.
Case . Note that now equations (1.9) become
[TABLE]
Hence we can obtain a solution to (1.9) by defining . Case . Equations (1.9) are equivalent to
[TABLE]
Multiplying the first two equations by and , respectively, and then adding them up, we obtain the third equation. Define
[TABLE]
Thus, the first two equations of (2.11) become
[TABLE]
where , are positive constants.
We define three continuous functions with the domain by
[TABLE]
It is easy to see that the function has a minimum value at some point . Then, we have
[TABLE]
Since all the coefficients of the above equations are positive, we must have
[TABLE]
Hence there exists a positive solution to (2.14) and therefore there exist , such that (1.9) holds. Case . Note that the last equation of (1.9) is implied by the first equations. If we define for , then equations (1.9) become equations of the type (1.8). Therefore, the proof is completed by Theorem 1.1.
3 Proof of Theorem 1.4
Let be a function on . We define
[TABLE]
is a supermartingale of . The upper bound (1.12) can be proved by following the standard argument (see [1]). In the following, we will focus on the proof of the lower bound (1.11).
Define
[TABLE]
Let be an open subset of . Denote by the measure on satisfying
[TABLE]
If is small enough, then for each . From the definition of , we find that
[TABLE]
Hence . Since is arbitrary, and thus . Therefore, to prove (1.11), we need only prove that
[TABLE]
Let be a function on . We define
[TABLE]
The generator of the semigroup is given by
[TABLE]
That is, for any , we have
[TABLE]
Then, the matrix associated with , denoted by , is given by
[TABLE]
Denote by the Markov chain associated with . By (3.2) and the assumption that , we find that is an ergodic Markov chain. Hence has a unique invariant distribution, which is denoted by . Note that
[TABLE]
By the ergodicity of , we obtain that
[TABLE]
We define
[TABLE]
If we can prove the following claim
[TABLE]
then we obtain by (3.3) that
[TABLE]
and thus (3.1) is proved.
In the following, we will prove claim (3.4). Let . We write
[TABLE]
where is a function on satisfying for each . To show that , it is sufficient to show that there exists a function such that
[TABLE]
Note that
[TABLE]
Hence, to show that , it is sufficient to show that there exist , , such that
[TABLE]
For , we define
[TABLE]
Then, equations (3.5) become equations (1.9). Since the existence of solutions to equations (1.9) is guaranteed by Theorem 1.2, the proof is complete.
Acknowledgments This work was supported by National Natural Science Foundation of China (Grant No. 11371191), Natural Sciences and Engineering Research Council of Canada (Grant No. 311945-2013), Natural Science Foundation of Hainan Province (Grant No. 117096), and Scientific Research Foundation for Doctors of Hainan Normal University.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. D. Donsker and S. R. S. Varadhan: Asymptotic evaluation of certain Markov process expectations for large time, I, Comm. Pure. Appl. Math. 28 , 1–47 (1975).
- 2[2] M. D. Donsker and S. R. S. Varadhan: Asymptotic evaluation of certain Markov process expectations for large time, II, Comm. Pure. Appl. Math. 28 , 279–301 (1975).
- 3[3] M. D. Donsker and S. R. S. Varadhan: Asymptotic evaluation of certain Markov process expectations for large time, III, Comm. Pure. Appl. Math. 29 , 389–461 (1976).
- 4[4] M. D. Donsker and S. R. S. Varadhan: Asymptotic evaluation of certain Markov process expectations for large time, IV, Comm. Pure. Appl. Math. 36 , 183–212 (1983).
- 5[5] M. Fukushima and M. Takeda: A transformation of a symmetric Markov process and the Donsker-Varadhan theory, Osaka J. Math. 21 , 311–326 (1984).
- 6[6] M. Fukushima, O. Oshima and M. Takeda: Dirichlet forms and symmetric Markov processes, Walter de Gruyter, (2010).
