We propose certain conditions implying the functional law of the iterated logarithm (the Strassen invariance principle) for some general class of non-stationary Markov–Feller chains. This class may be briefly specified by the following two properties: firstly, the transition operator of the chain under consideration enjoys a non-linear Lyapunov-type condition, and secondly, there exists an appropriate Markovian coupling whose transition probability function can be decomposed into two parts, one of which is contractive and dominant in some sense. Our criterion may serve as a useful tool in verifying the functional law of the iterated logarithm for certain random dynamical systems, developed e.g. in biology and population dynamics. In the final part of the paper we present an example application of our main theorem to a mathematical model describing stochastic dynamics of gene expression.
The law of the iterated logarithm (LIL) can be viewed as a refinement of the strong law of large numbers (SLLN). It improves the convergence rate in the SLLN from to . More specifically, it provides the precise values of the lower and upper limit of almost all sequences formed by the properly scaled partial sums (or integrals) of the sample paths of the stochastic process under study. Moreover, the LIL gives an interesting illustration of the difference between almost sure and distributional statements, such as the central limit theorem (CLT).
The functional version of the LIL, now usually called the Strassen invariance principle, was first proven for sums of independent and identically distributed random variables by V. Strassen (cf. [24]). Later, it was extended to square integrable martingales (see e.g. [9,10]) and also to certain particular classes of Markov chains, including stationary processes (cf. [27,28]), as well as non-stationary ones. The latter include, for instance, positive Harris recurrent Markov chains with drift towards petite sets (cf. [21, Theorem 17.5.3]) or Markov–Feller chains enjoying the exponential mixing property in the Wasserstein metric (see [1]). At this point, it is worth stressing that the well-known techniques developed by S.P. Meyn and R.L. Tweedie [21] are usually only applicable if the state space of the examined Markov chain is locally compact, which is not the case neither here, nor in [1].
The main result of this paper is a version of the Strassen invariance principle for a quite general class of non-stationary Markov–Feller chains evolving on Polish spaces. However, on the contrary to [1], we use a form of exponential mixing (in the Fortet–Mourier metric; cf. [3,4]), in which a distance between measures and , where P is a transition operator of a Markov chain, does not depend on a distance between initial distributions and (similarly as in [8]). More precisely, the overall strategy of the proof of our main result (Theorem 4.7) is based on the condition of the form
rather than
where stands for the above-mentioned Fortet–Mourier distance, while V is a Lyapunov function.
It is also worth stressing that we do not assume condition (1) directly. Instead, we propose a set of conditions, relatively easy to verify, which yield (1) and the desired assertion. The motivation to establish such a result derives from our research on certain random dynamical systems, applied mainly in molecular biology (see e.g. the models for gene expression investigated in [3,11,20] or the model for cell cycle discussed in [18,26]), to which we have not been able to apply [1, Theorem 1] directly. This is primarily caused by the fact that, upon certain general conditions imposed on the model (which appear to be reasonable in most applications), (2) seems to be difficult or even impossible to achieve, whilst the same conditions naturally imply (1), as shown e.g. in [3, Theorem 4.1].
The class of Markov–Feller chains for which we state our main result (Theorem 4.7), that is, the Strassen invariance principle for the LIL, can be characterized briefly by the following two properties. Firstly, the transition operator of the chain under consideration enjoys a non-linear Lyapunov-type condition. Secondly, there exists an appropriate Markovian coupling, whose transition function can be decomposed into two parts, one of which is contractive and dominant in some sense. The construction of such a coupling is described in details e.g. in [8,15,23,26]. Some proof techniques, employed in this paper, are adapted from the articles [1] and [12], which both pertain to the martingale results by C.C. Heyde and D.J. Scott [10]. One of the simplest classes of Markov chains achieving the desired properties are those arised from random iterated function systems with an arbitrary number of transformations, which are assumed to be contractive on average, such as those considered in [14,15,23,25].
Our main result is formulated in the same spirit as [15, Theorem 2.1] and [4, Theorem 2.1], whose applicability was illustrated by proving the exponential ergodicity (in the Fortet–Mourier distance) and the CLT, respectively, for some, important from the application point of view, random dynamical system (cf. [3,5]). Here we use our generel result to establish the functional LIL for such a model (cf. Theorem 5.2).
The aforementioned dynamical system has interesting biological interpretations. First of all, it can be viewed as the Markov chain given by the post-jump locations of some piecewise-deterministic Markov process, discussed in Section 5, which occurs in a simple model of gene expression (cf. [3,20]). Incidentally, this process can be also identified with the solution of a Poisson driven stochastic differential equation (in the context cosidered in [5,13,16]), mainly developed by A. Lasota and J. Traple [19]. On the other hand, a special case of the above-mentioned abstract random dynamical system, defined as an iterated function system with an additive perturbation (see [12]), provides a mathematical framework for modelling the concentration of the compunds involved in the gene autoregulation at times of transcriptional bursts (for details, see [11]). The latter example indicates the importance of considering a non-locally compact space as the state space in the abstract framework. Furthermore, it is also worth mentioning that in the case where no disturbance is present, we obtain an ordinary random iterated function system (with an arbitrary set of transformations), which applies e.g. in a model of cell cycle (cf. e.g. [18,26]).
Finally, let us point out, that, beside the examples captured by the model discussed in Section 5, there exist other dynamical systems, such as e.g. the one considered in [23], which fits the abstract framework of Theorem 4.7, but cannot be obtained as a special case of the aforementioned model.
The article is organised as follows. In Section 2, we gather notation and definitions used throughout the paper. We mainly relate to the general theory of Markov chains, discussed more widely e.g. in [21,22], and, in particular, we introduce the concept of a Markovian coupling. In Section 3, we quote some auxiliary results, established in [4,15], while in Section 4, we formulate and prove our main result. At the beginning of this section, we also present a few general observations concerning martingales, whose proofs are carried out in Appendix. Finally, in Section 5, we apply our main result to the above-mentioned particular dynamical system (considered e.g. in [3]), related to a model of gene expression.
Preliminaries
In the beginning, we shall introduce some notation and recall certain general definitions, as well as basic facts that will be used in our further analysis.
Let us write and with standing for the set of all positive integers. For any point x and any set A, the symbols and will denote the Dirac measure at x and the indicator function of A, respectively.
We consider a complete separable metric space , endowed with the σ-field of its Borel subsets. By we will denote the space of all bounded Borel measurable functions , equipped with the supremum norm , while and will stand for the subspaces of consisting of all continuous and all Lipschitz continuous functions, repectively. In the present paper we shall also refer to the space consisting of functions which are Borel measurable and bounded below.
In what follows, we will write and for the sets of all finite and all probability Borel measures on X, respectively. We shall also introduce
and any given Lyapunov function , that is, a continuous function which is bounded on bounded sets, and, in the case of unbounded X, satisfies for some . For brevity, for any and any signed Borel measure μ on X, we will write for . As usual, will denote the support of .
To evaluate the distance between probability measures, we will use the so-called Fortet–Mourier distance (see e.g. [17]), defined as follows:
where
and stands for the minimal Lipschitz constant of f. It is well-known that, whenever is a complete separable metric space, which is the case here, the convergence in is equivalent to the weak convergence of probability measures. Moreover, upon this assumption, the space is complete (see [7] for the proofs of both these facts).
A mapping is called a (sub)stochastic kernel if is a Borel measurable function for any fixed , and is a (sub)probability Borel measure for any fixed . Given a (sub)stochastic kernel Π, we can also define the n-th step kernels , , by setting, for every and any ,
Every stochastic kernel Π naturally induces a Markov operator and its dual operator , which are given by the formulas:
By the duality of operators P and U we mean the following relationship:
Let us note that U, given by (4), can be extended in the usual way to the space so that (5) holds for all functions f from this space.
Let P be an arbitrary Markov operator defined as in (3). If for some , then is called an invariant measure of P. The operator P is said to be exponentially ergodic in (on the set ) whenever it has a unique invariant measure and there exists such that
where is a constant depending on μ.
Suppose now that is an X-valued time-homogeneous Markov chain defined on a probability space . Then the formula
defines a stochastic kernel, which determines the so-called one-step transition law of the chain . The evolution of the distributions can be then described by the Markov operator P induced by Π (called a transition operator in this context), i.e. for any .
On the other hand, for any given stochastic kernel Π and any probability measure , we can always define a time-homogeneous Markov chain with transition law Π and initial measure μ as a coordinate process on the space endowed with the product topology. More specifically is then a sequence of projections from Ω to X, given by for . In this case, according to [21, Theorem 3.4.1], there exists a probability measure such that, for any and any , we have
It can be shown that is then a time-homogeneous Markov chain on the probability space with transition law Π and initial distribution μ. Clearly, is then the probability of the event for . The Markov chain defined according to the above scheme will be further called a canonical Markov chain. The expectation operator corresponding to will be denoted, as usual, by . Moreover, by convention, for any , we will write and rather than and , respectively. Obviously, one can easily check that
A time-homogeneous Markov chain evolving on (endowed with the product topology) is said to be a Markovian coupling of some stochastic kernel Π whenever its transition law satisfies
Conventionally, the kernel C itself is often called a coupling of Π, too.
In practise, given a measure , it is convenient to consider the canonical form of the coupling , defined on the coordinate space endowed with an appropriate probability measure , which makes α the initial distribution of this chain and obeys the rule corresponding to (7) with C and in the roles of P and , respectively. In accordance with the convention adopted above, we will use the symbol instead of in the case where for some . The expected values corresponding to and will be denoted by and , respectively.
Let us also indicate that, for any stochastic kernel and any substochastic kernel satisfying
there exists a substochastic kernel such that is a Markovian coupling of Π (see e.g. [3,15,26] for the explicit formula of R).
Conditions sufficient for exponential ergodicity
Consider a stochastic kernel , and let P, U be the operators given by (3), (4), respectively. Below, and throughout the rest of this paper, we will impose the following assumptions:
The Markov operator P has the Feller property.
There exist a Lyapunov function and constants , such that
Furthermore, we will also require the existance of a substochastic kernel which satisfies (8) and, for some , enjoys the following conditions:
There exists a Markovian coupling of Π with transition law such that, for some , we can choose and for which
where
There exists such that
Letting for any , we have
There exist constants and such that
Below, we quote two results that we extensively use in the present paper. They are proven in [15] and [4], respectively.
Suppose that conditions (
B0
)–(
B5
) hold for a Markov operator P, some substochastic kernel, satisfying (
8
), and some. Then, P possesses a unique invariant measuresuch that, where V is the Lyapunov function determined by (
B1
). Moreover, there exist constantsandsuch that
Under the assumptions of Theorem
3.1
(except for condition (
B0
)), there existandsuch thatfor all,and, where the couplingfulfills (
B2
).
The key idea underlying both Theorem 3.1 and Lemma 3.2, in which conditions (B0)–(B5) are assumed, pertains to the so-called asymptotic coupling technique, introduced by M. Hairer in [8]. Roughly speaking, conditions (B1)–(B5) provide the existence of a Markovian coupling of Π, whose transition function, say C, can be decomposed into two substochastic kernels, one of which, denoted by Q, enjoys the contractivity property, expressed by (B3), and plays a dominant role in the evolution of the coupling. The most technical condition (B2) ensures that the dynamics under consideration quickly enters the set F, that is, the domain of contractivity of Q. By the dominance of Q we mean the existence of an a.s. finite random time, say τ, after which any further step of the coupled chain is drawn only according to Q. Establishing this property involves the use of all hypotheses (B1)–(B5). The dominant, contractive part Q makes the copies of the Markov chain (governed by P) couple asymptotically at an exponential rate.
To better illustrate the main idea behind conditions (B1)–(B5), let us sketch very briefly the proof of Lemma 3.2. The crucial point here is to consider an augmented coupling of the form with values in , constructed in such a way that
Then, the aforementioned random variable τ can be defined as an absorption time of the form
Further, we get
for any , and integers satisfying , where
Then, conditon (B3) allows one to estimate the first component on the right-hand side of (12) by with some . Hypotheses (B1) and (B2) are applied to show that there exists and such that
which, in particular, yields that for some . Further, condition (B4), together with (B3) and (B5), enables one to conclude that there exist , and such that
where . Having established (13) and (14), one can show (as in [15, Lemma 2.2]) that there exist and for which
whence . The assertion of Lemma 3.2 then follows from (12).
A simple example of a model for which conditions (B0)–(B5) can be easily verified is a random iterated function system, considered e.g. in [15]. Note that within such an example the Markov operator P and the substochastic kernel Q are defined explicitly, and thus verifying conditions (B0)–(B5) becomes just a technical part.
A criterion on the Strassen invariance principle for the LIL
The section is divided into two parts. The first one contains a few general observations concerning martingales defined on the path space of a given ergodic Markov chain, while the second one presents the main result of this paper, that is, a criterion on the Strassen invariance principle for the LIL for a class on non-stationary Markov–Feller chains. The proof techniques that we use are mainly based on [1] and [12].
Consider an arbitrary stochastic kernel and the corresponding operators and , given by (3) and (4), respectively. Further, fix , and let be an X-valued time-homogeneous Markov chain on a probability space with transition law Π and initial distribution μ.
To streamline the forthcoming proofs, in what follows, we assume (without loss of generality) that is defined as a canonical chain on the coordinate space, and thus we take . By we shall denote the natural filtration of this chain. Moreover, we let stand for the shift operator, that is, for any .
Auxiliary results
In the remainder of this subsection, we assume that P admits a unique invariant probability measure , and that converges weakly to , as .
Let be a real-valued martingale with respect to such that for any , where and . Further, define
and
Now, let denote the σ-algebra of T-invariant sets, i.e.
Since is the unique stationary distribution of , it follows that the measure is invariant and ergodic with respect to T (see [6, Proposition 7.16]), that is,
The Birkhoff theorem for ergodic Markov chains (cf. [6, Theorem 7.19]) then implies the following statement:
Ifis a-integrable random variable, then
Let be an arbitrary Markovian coupling of Π defined on some properly constructed probability space , and recall that denotes the expectation operator with respect to for every . For any given random variable , we can now consider two copies of Z, defined as
In what follows, we formulate a few lemmas, whose proofs are given in Section x.
Suppose thatThen, for anyand any, the functions, given byare constant (and, in particular, continuous). By convention, we putifand.
Suppose that the functionsand, given by (
18
), are continuous for alland any. Then, for every, we haveIn particular, for, we obtainwhereis defined by (
15
).
Suppose that condition (
17
) holds, and that, for some, there existssuch thatThenand also
Suppose that condition (
17
) holds, and that (
19
) is fulfilled with some. Then, there existssuch thatfor all, and the following statements hold:
The invariance principle for the LIL for certain Markov–Feller chains
In the analysis that follows, we additionally require that the Markov operator P enjoys the Feller property, stated as condition (B0), and that (B1) holds with the Lyapunov function V of the form
where is an arbitrarily fixed point of X. Moreover, we assume that there exists a substochastic kernel Q on , satisfying (8), such that hypotheses (B3)–(B2) hold for some . Under these settings, Theorem 3.1 yields that P possesses a unique invariant probability measure , such that , and that condition (10) is fulfilled for some and some .
Let , and define . Obviously, . Using (10), for any and any , we can write
where . It then follows that
which enables us to define
Note that has the following property:
where the last inequality follows from (24).
Now, introduce
and observe that is a martingale with respect to the natural filtration of (for the proof see e.g. [12, Lemma 3]). Furthermore, we define
One can easily check that for any .
Let us now define as a Banach space of all real-valued continuous functions on with the supremum norm. By we will denote the subspace of consisting of all absolutely continuous functions f such that and . Further, consider the sequence of random variables with values in , determined by
For any given function , we say that the Markov chain satisfies the invariance principle for the LIL if , the family is relatively compact in , and the set of its limit points coincides with -a.s. Observe that, whenever the chain satisfies the invariance principle for the LIL, it also obeys the LIL itself. Indeed, if , then for any we can define
which, due to the definition of , satisfies
Our aim now is to establish the main result of this paper. It shall be formulated in the same spirit as Theorem 3.1 and [4, Theorem 3.2] (see [2–5] for possible applications of these theorems). While hypotheses (B0)–(B5) are sufficient for the Markov operator P to be exponentially ergodic in , our proof of the Strassen invariance principle for the LIL will additionally require the following condition:
There exist and such that, for any ,
Let us compare condition (B1∗) with (B1′), which has been employed in [4] to establish the CLT for a subclass of Markov–Feller chains described in Section 3. The latter guarantees the existence of and such that
One can observe that (B1′) is a stronger version of (B1). Condition (B1∗) is of the same type, although, in general, it does not need to imply (B1). Consequently, in Theorem 4.7 we assume both (B1) and (B1∗).
Suppose thatis an X-valued time-homogeneous Markov chain with transition law Π and initial distribution μ such thatfor some. Let P denote the Markov operator corresponding to Π. Further, assume that there exists a substochastic kernelsatisfying (
8
), such that conditions (
B0
)–(
B5
) and (
B1
∗
) hold for P and Q with some. Then, for every non-constant, the chainobeys the Strassen invariance principle for the LIL.
Before we prove Theorem 4.7, we first need to state several auxiliary facts. Lemmas 4.8–4.10, established below, concern certain properties of , given by (29), while Lemma 4.11 indicates mutual relations between and , given by (30) and (31), respectively. Finally, Lemmas 4.12 and 4.13 allow us to assure a form of the functional LIL for the sequence of martingale increments (cf. [10, Theorem 1]).
Let be a coupling of Π such that condition (B5) holds.
Under the assumptions of Theorem
4.7
, we havewhereandare defined according to the rule given in (
16
), applied to the above-specified coupling.
First of all, note that
Further, we can deduce that
Hence, applying Lemma 3.2, we infer that there exist and such that
for every . Combining (33) with (34), finally gives
which completes the proof. □
Let and . One can easily check that, for every , there exists such that
Hence, due to the definition of , we obtain
where the last term can be majorized by . Then, according to (27), there exist and such that, for all ,
Further, from (B1∗), it follows that
which gives
Finally, recalling that , we obtain
with
The proof of Lemma 4.9 is therefore completed. □
For every , we define by for . Note that for all . Hence, keeping in mind that and that converges weakly to , as , we have
Observe that is a non-increasing sequence of non-negative functions satisfying for any . Therefore, using the Monotone Convergence Theorem, together with (38) and (36), we obtain
which implies that .
Hence, according to Lemma 4.9 and the Hölder inequality, we in particular obtain , which completes the proof. □
Under the assumptions of Theorem
4.7
, for every, we havewhereandare defined by (
30
) and (
31
), respectively.
The assertion follows from Lemma 4.4. Note that conditions (17) and (19) are provided by Lemmas 4.8 and 4.9, respectively. □
Let. Under the assumptions of Theorem
4.7
,and, given by (
29
) and (
31
), respectively, are related with each other in the following way:
Lemmas 4.8 and 4.9 guarantee that satisfies the assumptions of Lemma 4.4, which in turn implies the assertion of this lemma. □
Under the assumptions of Theorem
4.7
, for any, we have
Having in mind that condition (19) is provided by Lemma 4.9, we see that the claim follows directly from Lemma 4.5. □
We are now in a position to prove the main theorem. As mentioned earlier, an essential step in our proof will be applying [10, Theorem 1].
The existence and uniqueness of an invariant probability measure for P, further denoted by , follows from Theorem 3.1. The proof proceeds in two steps.
Step I. Let be an arbitrary non-constant function. First of all, we will show that the sequence , where is given by (31), is strictly increasing for some sufficiently large , which equivalently means that for any . Along the way, we will also get . Since , we can write
where the second equality follows from the Markov property. According to (29), we have
Note that , and therefore we can apply to it the extension of the dual operator U, given by (4). On the other hand, from (25) and (B1) (with ), it follows that is integrable with respect to for every , and thus is well-defined for any . Further, observe that
Now, combining (43) with (44), we obtain
which implies that if and only if . Naturally, the weak inequality always holds due to the Cauchy–Schwarz inequality, and it can only be an equality in the case of for some . Hence, whenever is not a constant function, (42) and (45) imply that for every . This, in turn, yields that is strictly increasing, and, in particular guarantees that . Otherwise, if , then , and thus, due to (42), we see that
On the other hand, from Theorem 3.1 it follows that
which, according to the Cauchy–Schwarz inequality, gives
since g is not constant. Consequently, (46)–(48) imply that, in the case of constant , the sequence is strictly increasing for some sufficiently large . Let us also observe that (48) guarantees that , as claimed.
In view of the above, we may assume, without loss of generality, that the sequence is strictly increasing, and therefore we are allowed to introduce
Note that, according to Lemma 4.11, we have
Further, Lemmas 4.12 and 4.13 ensure conditions (39) and (40), (41), respectively. Combining this with (50) and referring to [10, Theorem 1], we can conclude that is relatively compact in , and that the set of its limit points coincides with -a.s.
Now, let us define
Observe that, for any , and satisfying , one can write
By virtue of Lemma 4.11 we know that . Hence, due to (52), for any and sufficiently large n, we obtain
Our goal for now is to prove that the functional LIL holds for the sequence , that is, is relatively compact in , and the set of its limit points coincides with -a.s. For this purpose, it suffices to show that, for every , there exists a sequence of positive numbers such that
To do this, fix , and let k be such that . According to definitions (49) and (51), we see that the equality is satisfied for
whenever
But (55) obviously holds, since . Moreover, for every ϵ and sufficiently large n, we have
Indeed, from (53) and (55) it follows that, for ,
and, according to Lemma 4.11,
converges to 1 as n, and therefore also as k, tends to infinity. This finally implies that , as , and thus the desired conclusion follows.
Step II. To complete the proof, it suffices to show that
where is given by (32). Indeed, note that (56), together with the conclusion of Step I, implies that satisfies the invariance principle for the LIL.
In order to establish (56), fix an arbitrary and, for any with (that is ), define the sets
Further, choose such that (35) holds with (specified in the assumptions of the theorem). Using this property, as well as the Markov inequality, we obtain
From (27) we know that there exist and such that, for any ,
Then, taking into account condition (B1∗), and arguing as in (36), we obtain
Hence, for any and ,
where is some constant independent of k and n. Similarly to this, we deduce that
where also does not depend on k and n. Clearly, (58) and (59) imply that for every , and therefore, from the Borel–Cantelli Lemma, it follows that for any . Let
Obviously, . Furthermore, for each , one can choose such that
for every and any satisfying . The proof is now completed, since was chosen arbitrarily. □
Analyzing the proof of Theorem 4.7 shows that its assertion remains valid under two more general (and simultaneously, much more abstract) hypotheses, namely:
there exists a Markovian coupling of Π for which condition (11) is satisfied.
Let us conclude this section with a brief comparison of the foregoing remark and [1, Theorem 1]. First of all, hypothesis (H2) in [1], if formulated for the Fortet–Mourier distance, would be, in fact, equivalent to the existence of a Markovian coupling for which there exist and such that, for any ,
On the other hand, conditions (B0)–(B5), assumed here, imply (11), which can be also written in the following form:
where and depends on μ and ν. Obviously, none of these conditions need not imply the other. However, it is natural to expect that verifying hypothesis (60), corresponding to (H2) from [1], will usually require establishing the inequality
which is clearly stronger (and more difficult to assure in applications) than condition (61), used in this paper.
Moreover, it is not hard to show that hypotheses (H1) and (H3), assumed in [1], can be derived from conditions (B1) and (B1∗), respectively. It should be, however, noted that, in practise, verifying those former would usually come down to checking those latter.
Let us also stress that, according to Lemma 3.2, hypotheses (B1)–(B5), involving the Markov operator P and a suitable “subcoupling” Q on , do imply condition (61), and thus Theorem 4.7 does not demand assuming this property directly. For explicitly defined random dynamical systems, it is quite intuitive how to define Q (see e.g. (6.9) in [3], where the model from Section 5 is considered, or cf. the proof of [15, Proposition 3.1], concerning a random iterated function system with an arbitrary set of transformations).
Summarizing the above discussion, none of the aforesaid results, that is, [1, Theorem 1] and the conclusion formulated in Remark 4.14, need not imply the other, yet the statement given in Remark 4.14 may potentially have wider applications than [1, Theorem 1] due to the more practical version of condition (H2).
An abstract model for gene expression
In this part of the paper, we intend to apply Theorem 4.7 to a particular random dynamical system, introduced in [3], which provides, among others, a mathematical framework for the analysis of gene expression dynamics (cf. e.g. [3,11,20] for biological interpretation).
Let and Y be a separable Banach space and a closed subset of this space, respectively. Further, for any and any , let denote an open ball in H centered at x and of radius r. We additionally consider a topological measure space with a σ-finite Borel measure Δ. With a slight abuse of notation, we will write instead of in the rest of the paper. Finally, fix , and endow the set with the metric given by for and for .
The subject of our interest will be a discrete-time random dynamical system, defined by the post-jump locations of a piecewise-deterministic stochastic process , evolving on the space Y. The jumps of this process occur at random time points , , which coincide with the jump times of a Poisson process with intensity λ. In the time intervals , , where , the dynamics is deterministically driven by a finite number of semiflows , , which are assumed to be continuous with respect to each variable. The semiflows are switched at the jump times according to a matrix of continuous probabilities , , which satisfy for any and .
The above description can be formalized by putting
where is an I-valued random variable indicating the index of a semiflow chosen directly after the n-th jump. The post-jump location is a result of a transformation of the state just before the jump, i.e. , attained by a function randomly selected among all the possible ones , , and adding a random disturbance , which remains within an ε-neighbourhood of zero. Formally, we may therefore write
It is required that all the maps are continuous. Further, we assume that, for some , all the variables , , have a common distribution supported on , and that
Moreover, the probability of choosing (at the jump time ) is determined by a density , whenever , where is a given continuous function satisfying for any .
Now, consider the set , endowed with the metric of the form
where is a positive constant. The main goal of this section is to establish the functional LIL for the sequence of random variables with values in X, where and is the I-valued random variable appearing in (63). The joint distribution of will be denoted by . The sequence can be defined on an appropriate probability space, say , in such a way that, for every ,
whilst , taking values in I, and the remaining, auxiliary sequences of random variables , and with values in , Θ and H, respectively, are specified by the following conditions:
, almost surely, as , and the increments , , are mutually independent and have the common exponential distribution with intensity ;
, , are identically distributed with ;
and , , are defined inductively, so that
where
We also demand that, for any , the variables , , and are (mutually) conditionally independent given , and that and are independent of .
An easy computation shows that is a time-homogeneous Markov chain with transition law given by
for any and any .
Let us now detail the conditions that have been employed in [3] (cf. also [5]), in order to establish the exponential ergodicity for the chain in the Fortet–Mourier distance. Namely, it is assumed that there exist , a function that is bounded on bounded sets, and constants , such that
and, for any , , , the following conditions hold:
where .
From the proof of [3, Theorem 4.1] it follows that, if conditions (A1)–(A5) hold with α, L and satisfying (67), and the constant , appearing in (64), is sufficiently large (according to the constants in the hypotheses above; cf. [3]), then the assumptions of Theorem 3.1, i.e. (B0)–(B5), are fulfilled for the Markov operator P corresponding to Π, defined by (66), and some substochastic kernel Q on . The latter, for any and , is given by
Consequently, P is then exponentially ergodic in induced by the metric , defined by (64).
It should be pointed out here that, in the proof of [3, Theorem 4.1], condition (B1) has been verified for the Lyapunov function of the form
with determined by (A1). However, let us observe that (B1) must be also fulfilled for the Lyapunov function , considered in this case, which is defined by
where , and is an arbitrarily fixed element of I, which is in accordance with the assumptions imposed in Section 4.2, wherein Theorem 4.7 is stated.
Willing to verify the Strassen invariance principle for the LIL, we need to strengthen conditions (67), (A1) and (A3). Namely, we require that there exist and , satisfying
such that, for some , the following statements hold:
Due to the Hölder inequality, conditions (
A1
∗
) and (
A3
∗
) imply (A1) and (A3), respectively, and the latter hold with .
Furthermore, let us observe that inequality (71) implies (67). To see this, suppose, conversly to (67), that . Then, noting that , we obtain , which due to the Bernoulli inquality, leads to the contradiction with (71).
Letbe the Markov chain with transition law Π given by (
66
) and initial distribution. Further, assume that conditions (
A1
)–(
A5
) with (
A1
) and (
A3
) strengthened to (
A1
∗
) and (
A3
∗
), respectively, hold with constants,andsatisfying (
71
). Then, for every non-constant, the chainobeys the invariance principle for the LIL, provided thatfor the Lyapunov function, given by (
69
).
We intend to apply our criterion on the invariance principle for the LIL, stated as Theorem 4.7, for the Markov operator P induced by Π and the substochastic kernel Q given by (68). To this end, let us first observe that , where is defined by (69). This yields that . Moreover, as mentioned earlier, conditions (B0)–(B5) can be derived from (A1)–(A5), fulfilled with L, and α satisfying (67) (as it was shown in the proof of [3, Theorem 4.1]), and so, according to Remark 5.1, they can be also derived from the assumptions of this theorem.
In the light of the above, the proof of Theorem 5.2 reduces to showing (B1∗). In order to do this, first of all, note that
Now, introduce (where ), and define as follows:
Let us further consider given by
for any , , , and . Observe that is a non-negative Borel measurable function, and that
Consequently, using the Minkowski inequality, we obtain
where the second component on the right-hand side of the above inequality is finite due to (
A1
∗
). According to assumptions (
A3
∗
) and (A2), we further have
where the last inequality follows from the fact that , which is provided by (71). Hence, referring to (73) and (74), we obtain condition (B1∗) with
Moreover, due to condition (71), we see that , which completes the proof. □
An important special case of the above-discussed Markov chain, obtained by putting and , is a random iterated function system with an additive disturbance (see [12]), which occurs e.g. in a stochastic model of single-gene autoregulation (described in [11]). In this setting, , evolving on , can be identified with the Y-valued chain , which takes the form:
The one-step transition law is then given by
In the case where no disturbance occurs, i.e. for all , the system reduces to a standard random iterated function system, which can serve, for instance, as a model of cell cycle (see [18,26]). A bit more general version of such a system is also investigated in [15].
In this particular situation, conditions (67) and (A1)–(A5), guaranteeing the exponential ergodicity in , can be simplified to the following requirements: there exist , , and such that, for any , we have
where . Note that (67) is then trivially satisfied, since , and we can take and .
Clearly, in order to apply Theorem 5.2, i.e. our criterion on the functional LIL, we need to assume the appropriately simplified versions of (
A1
∗
) and (
A3
∗
), rather that (A1) and (A3), that is, the existence of and such that
Obviously, inequality (71) then also holds trivially.
While the proof of the earlier-mentioned [3, Theorem 4.1], guaranteeing that conditions (B0)–(B5) hold for the general model, is rather long and technical, in this particular case, these conditions can be derived directly in a relatively simple way (cf. [15, Proposition 3.1]). More specifically, from the continuity of and it follows that the Markov operator P (corresponding to Π, given by (66)) enjoys the Feller property, i.e. (B0) holds. If we now consider the appropriately simplified form of the kernel Q, defined on by
for any , , and we take , then hypotheses (B1), (B4), (B5) and (B2) can be deduced almost immediately from (A1′) & (A3′), (A3′), (A5′) and (A4′), respectively, while (B2) is trivially satisfied (as the domain of contractivity is ). Finally, to prove the LIL, it suffices to note that (B1∗) follows from (
A1
∗
′
) and (
A3
∗
′
).
Footnotes
Acknowledgements
Hanna Wojewódka-Ściążko was supported by the Foundation for Polish Science (FNP). Part of this work was done when Hanna Wojewódka-Ściążko attended a four-week study trip to the Mathematical Institute at Leiden University, which was also supported by the FNP (the so-called ‘Outgoing Stipend’ in the START programme).
Within the appendix, we present the proofs of lemmas from Section 4.1.
References
1.
W.Bołt, A.A.Majewski and T.Szarek, An invariance principle for the law of the iterated logarithm for some Markov chains, Studia Mathematica212(1) (2012), 41–53. doi:10.4064/sm212-1-3.
2.
D.Czapla, A criterion on asymptotic stability for partially equicontinuous Markov operators, Stochastic Processes and their Applications128(11) (2018), 3656–3678. doi:10.1016/j.spa.2017.12.006.
3.
D.Czapla, K.Horbacz and H.Wojewódka-Ściążko, Ergodic properties of some piecewise-deterministic Markov process with application to gene expression modelling, Stochastic Processes and Their Applications, 2019. doi:10.1016/j.spa.2019.08.006.
4.
D.Czapla, K.Horbacz and H.Wojewódka-Ściążko, A useful version of the central limit theorem for a general class of Markov chains, Journal of Mathematical Analysis and Applications484(1) (2020), 123725. doi:10.1016/j.jmaa.2019.123725.
5.
D.Czapla and J.Kubieniec, Exponential ergodicity of some Markov dynamical systems with application to a Poisson-driven stochastic differential equation, Dynamical Systems34(1) (2018), 130–156. doi:10.1080/14689367.2018.1485879.
6.
D.Douc, E.Moulines and D.Stoffer, Nonlinear Time Series: Theory, Methods and Applications with R Examples, Chapman and Hall/CRC, New York, 2014.
7.
R.M.Dudley, Probabilities and Metrics. Convergence of Laws on Metric Spaces, with a View to Statistical Testing, Matematisk Institut, Aarhus Universitet, Aarhus, 1976.
8.
M.Hairer, Exponential mixing for a stochastic partial differential equation driven by degenerate noise, Nonlinearity15(2) (2002), 271–279. doi:10.1088/0951-7715/15/2/304.
9.
P.Hall and C.C.Heyde, Martingale Limit Theory and Its Application, Elsevier, 1980.
10.
C.C.Heyde and D.J.Scott, Invariance principles for the law of the iterated logarithm for martingales and processes with stationary increments, The Annals of Probability1(3) (1973), 428–436. doi:10.1214/aop/1176996937.
11.
S.Hille, K.Horbacz and T.Szarek, Existence of a unique invariant measure for a class of equicontinuous Markov operators with application to a stochastic model for an autoregulated gene, Annales mathématiques Blaise Pascal23(2) (2016), 171–217. doi:10.5802/ambp.360.
12.
S.Hille, K.Horbacz, T.Szarek and H.Wojewódka, Law of the iterated logarithm for some Markov operators, Asymptotic Analysis97(1–2) (2016), 91–112. doi:10.3233/ASY-151344.
13.
K.Horbacz, Invariant measures related with randomly connected Poisson driven differential equations, Annales Polonici Mathematici79(1) (2002), 31–44. doi:10.4064/ap79-1-3.
14.
K.Horbacz and T.Szarek, Irreducible Markov systems on Polish spaces, Studia Mathematica177(3) (2006), 285–295. doi:10.4064/sm177-3-7.
15.
R.Kapica and M.Ślęczka, Random iterations with place dependent probabilities, (2012) (2019), arXiv:1107.0707.
A.Lasota, From fractals to stochastic differential equations, in: Chaos-the Interplay Between Stochastic and Deterministic Behaviour, Lecture Notes in Phys. (Springer Verlag), Vol. 457, 1995, pp. 235–255. doi:10.1007/3-540-60188-0_58.
18.
A.Lasota and M.C.Mackey, Cell division and the stability of cellular populations, Journal of Mathematical Biology38(3) (1999), 241–261. doi:10.1007/s002850050148.
19.
A.Lasota and J.Traple, Invariant measures related with Poisson driven stochastic differential equation, Stochastic Processes and their Applications106(1) (2003), 81–93. doi:10.1016/S0304-4149(03)00017-6.
20.
M.C.Mackey, M.Tyran-Kamińska and R.Yvinec, Dynamic behavior of stochastic gene expression models in the presence of bursting, SIAM Journal on Applied Mathematics73(5) (2013), 1830–1852. doi:10.1137/12090229X.
21.
S.P.Meyn and R.L.Tweedie, Markov Chains and Stochastic Stability, Springer, London, 1993.
V.Strassen, An invariance principle for the law of the iterated logarithm, Zeitschrift for Wahrscheinlichkeitstheorie und Verwandte Gebiete3(3) (1964), 211–226. doi:10.1007/BF00534910.
25.
I.Werner, Contractive Markov systems, Journal of the London Mathematical Society71(01) (2005), 236–258. doi:10.1112/S0024610704006088.
26.
H.Wojewódka, Exponential rate of convergence for some Markov operators, Statistics & Probability Letters83(10) (2013), 2337–2347. doi:10.1016/j.spl.2013.05.035.
27.
L.Wu, Functional law of iterated logarithm for additive functionals of reversible Markov processes, Acta Mathematicae Applicatae Sinica16(2) (2000), 149–161. doi:10.1007/BF02677675.
28.
O.Zhao and M.Woodroofe, Law of the iterated logarithm for stationary processes, The Annals of Probability36(1) (2008), 127–142. doi:10.1214/009117907000000079.