Higham, Mao and Stuart in  initialised the study on the equivalence of stabilities between solutions of stochastic differential equations (SDEs) and their numerical solutions. To be more precise, it is proved in their paper that underlying solutions are mean square stable if and only if numerical solutions are also stable in the mean square sense. The result applies under the assumption of the finite time convergence of the numerical methods.
Mao in  extended such a result to stochastic differential delay equations (SDDEs). Zhao, Song and Liu in  investigated such equivalence for SDDEs with Poisson jump and Markov switching. More recently, Liu, Li and Deng in  studied neutral delayed stochastic differential equations for such a problem. Deng et la. in  extended results in  to SDDEs driven by -Brownian motion. All the works mentioned above were devoted to the exponential stability in the mean square sense.
Mao in  generalised the results in  to the case of pth moments and made some connections of the almost sure stability between SDEs and their numerical solutions. Yang and Li in  discussed similar problems in the -framework.
In this paper, we study the equivalence of pth moment stability between solutions of SDDEs and their numerical solutions, which could be regarded as a generalisation of . In addition, we investigate the truncated Euler-Maruyama (EM) method as an example. Compared with those classical Euler-type methods discussed in previous works mentioned above, we do not need to impose the global Lipschitz condition on either the drift or diffusion coefficient.
The truncated EM method was proposed originally by Mao in [15, 16] for SDEs. After that, plenty of works that employed the truncating technique have been done for SDDEs. For example, the truncated EM method was studied by Guo, Mao and Yue in , the partially truncated EM method was investigated by Zhang, Song and Liu in , and the truncated Milstein method was discussed by Zhang, Yin, Song and Liu in .
Our theorem on the truncated EM for SDDEs in this paper is of interest in two aspects. Firstly, the result of the truncated EM demonstrates Theorem 3.3 indeed covers a large class of SDDEs and numerical methods. Secondly, the requirement on the step size of the method is significantly released compared with the existing works, which is a stand-alone interesting result. It should be mentioned that many other interesting numerical methods have been proposed for SDDEs, for example [1, 2, 3, 4, 8, 9, 11, 10, 17, 18, 23] and the references therein.
The main contributions of this paper are summarized as follows.
A general theorem on the equivalence of pth moment stability between SDDEs and their numerical methods are stated and proved, which covers a large class of SDDEs and various numerical methods.
The constraint on the step size of truncated EM method for SDDEs is released, which makes the method more applicable.
This paper is constructed in the following way. The mathematical preliminaries are presented in Section 2. Section 3 sees the general theorem of the equivalence of the pth moment stability. Section 4 is devoted to the study on the truncated EM method. Numerical examples are conducted to demonstrate the theoretical results in Section 5. Section 6 concludes this paper by emphasizing the main contributions of this work.
2 Mathematical preliminaries
Throughout this paper we use the following notations. Let be the Euclidean norm in and
be the inner product of vectors. If A is a vector or matrix, its transpose is denoted by . If A is a matrix, its trace norm is denoted by . If is a real number, its integer part is denoted by . Let and . Let denote the family of continuous functions from to .
be a complete probability space with a filtrationsatisfying the usual conditions(i.e.,it is right continuous and contains all -null sets). Let be an m-dimensional Brownian motion defined on the probability space. Moreover, for two real numbers a and b, we use and . If G is a set, its indicator function is denoted by , namely if and otherwise. Denote by the family of -measurable,
valued random variablessuch that
If is a continuous -valued stochastic process on , we let for which is regarded as a valued stochastic process.
Let us consider the n-dimensional autonomous stochastic delay differential equations (SDDEs)
with the initial data , where and .
The solution to the SDDE (1) is said to be exponentially stable in th moment for any , if there is a pair of positive constants and such that, for any initial data
In this paper we often need to introduce the solution to the SDDE (1) for initial data give at time t=s. As long as the existence and uniqueness of this solution denoted by on is guaranteed. It is easy to observe that the solutions to the SDDE (1) have the following flow property:
A numerical method to the SDDE (1)is said to be exponentially stable in the moment for any if there is a pair of positive constants and such that with initial data ,
The next two assumptions are needed for Theorem 3.3. Briefly speaking, Assumption 2.3 needs that the underlying and numerical solutions have the finite th moment and Assumption 2.4 requires that the numerical solution converges to the underlying solution in a finite time with any convergence rate.
The underlying solution and the numerical solution to SDDE (1) satisfy
respectively, where is a constant independent of .
Write and define which is the numerical solution to the SDDE (1) with initial data starting from , then
where depends on T but not on and and is an increasing function with respect to .
3 A general theorem
To prove the main theorem, we present two lemmas firstly.
for all . Then there exists a such that for every , the numerical solution to the SDDE (1) is exponentially stable in moment with rate constant and growth constant , both of which are independent of . More precisely,
with and , where
Fix any initial data , write and define . The exponential stability in the moment if the SDDE (1) shows
By the definition of T, we observe that
By the elementary inequality
if necessary, let be even smaller so that
Recall that T is a multiple of and hence of . So, by the flow property, for any integer
Repeating the argument above for in the same way that (8) was obtained we may establish
From this we see that
By iteration, we can get that
Substituting this into (9) and bearing in mind that M must not be less than 1 we obtain that
That is, the numerical method is exponentially stable in the pth moment with and . This completes the proof. ∎
Lemma 3.1 shows that the expenential stable in the pth moment of the SDDE(1) implies the exponential stability in the pth moment of the numerical method for small . Let us now eatablish the converse theorem.
The proof of this lemma is proved in the same way as lemma 3.1 was proved, so we only give the outline but highlight the different part.
Fix any initial data , write and define . The exponential stability in the pth moment of the numerical method shows
Using (10) we get that
Repeating thie argument we find that
This together with (3), yields
as required. ∎
Now, we are ready for the main theorem.
The reason that we regard Theorem 3.3 as a general result is due to the assumptions we made, where only the finite time convergence and the moment boundedness of the numerical method in a very short time are needed, but no particular structure of the method is specified.
4 The truncated EM method
This section is to show that the truncated EM method is a numerical approximation whose th moment exponential stability is equivalent to that of the underlying SDDEs. To achieve this, we show the finite time strong convergence as well as the moment boundedness of the method firstly. Then the application of Theorem 3.3 implies the desired result.
4.1 Brief introduction
To make this paper self contained, we brief the truncated EM method for SDDEs in this part, along which we also discuss the fact that the requirement on the step size is weaken in this paper.
For the SDDE 1, we impose following assumptions on the drift and diffusion coefficients.
Assume that the coefficients f and g satisfy the local Lipschitz condition: For any , there is a such that
Assume that the coefficients satisfy the Khasminskii-type condition: There is a pair of constants and such that
We need an additional condition. To state it, we need a new notation. Let denote the family of continuous functions such that for each there is a positive constant for which
Assume that there is a pair of constants and such that
Assume that there is a pair of positive constants and such that
There is a pair of constants and such that the initial data satisfies
To define the truncated EM numerical solutions, we first choose a strictly increasing continuous function such that as and
Denoted by is the inverse function of and we see that is a strictly increasing continuous function from to . We also choose a constant and a strictly decreasing function such that
We will later that Assumption 4.4 implies (17), namely that both coefficients f and g grow at most polynomially, hence we can let , where is a positive constant specified in (17). Moreover, we can let for some . In other words, there are lots of choices for and .
A comparison of assumptions of the method in this paper and those in the previous work is presented in Appendix Appendix.
For a given step size , let us define a mapping from to the closed ball by
where we set when . That is, will map to itself when and to when . We then define the truncated functions
for . It is easy to see that
From now on, we will let the step size be a fraction of That is, we will use for some positive integer M. When we use the terms of a sufficiently small we mean that we choose M sufficiently large.
Let us now form the discrete-time truncated EM solutions. Define for Set for and then form
for where In our analysis, it is more convenient to work on the continuous-time step process on defined by
where is the indicator function of (please recall the notation defined in the beginning of this paper). The other one is the continuous-time continuous process on defined by for while for
We see that is an Itô process on with its Itô differential
It is useful to know that for every , namely they coincide at Of course, is computable but is not in general.
Let Assumption 4.2 hold. Then, for all , we have
The following lemma is useful to observe that the truncated functions and preserve assumption 4.4 perfectly.
Let Assumption 4.4 hold. Then, for all we have