Abstract
This article shows the geometric decay rate of the Euler–Maruyama scheme for a one-dimensional stochastic differential equation towards its invariant probability measure under total variation distance. Firstly, the existence and uniqueness of invariant probability measure and the uniform geometric ergodicity of the chain are studied through the introduction of non-atomic Markov chains. Secondly, the equivalent conditions for uniform geometric ergodicity of the chain are discovered by constructing a split Markov chain based on the original Euler–Maruyama scheme.
Keywords:
Euler–Maruyama scheme; invariant probability measure; total variation distance; uniform geometric ergodicity; langevin monte carlo; Markov chain Monte Carlo MSC:
Primary 60J27; 60B10; 62E20; Secondary 60H10; 62L20; 37M25
1. Introduction
Consider the following stochastic differential equation (SDE) on :
where is a standard Brownian motion, is a constant, and satisfies the hypothesis below.
Hypothesis (H1).
There exist L, and such that for every ,
Moreover, g is second-order differentiable, and the second-order derivative of g is bounded.
The inequality (2) implies for any ,
where represents the derivative of the function g. Moreover, the inequality (3) and Young’s inequality imply
with .
For a given step size , the Euler–Maruyama (EM) scheme for the SDE (1) is given by the following recursive relation: for any ,
where are independent and identically distributed standard normal random variables.
Over the past decades, EM schemes have been widely and intensively used for solution approximations of SDEs on with (see for instance [1,2,3,4,5,6,7,8]). In the case when with U being a potential, (1) is called Langevin diffusion, and (6) is called unadjusted Langevin algorithm (ULA) with constant step size. The ULA is nowadays a popular class of Markov chain Monte Carlo (MCMC) algorithms ([9]), which is commonly applied to solve Monte Carlo sampling problems especially in the field of machine learning (see, for instance, [10,11]). Roberts and Tweedie [12] initially provided probabilistic analysis of asymptotic behaviour of Langevin diffusion and ULA. They found necessary (Theorem 2.2, [12]) and sufficient conditions (Theorem 2.3, [12]) for exponential ergodicity of Langevin diffusion, and sufficient conditions for geometric ergodicity of ULA (Theorem 3.1, [12]) respectively. Dalalyan [13] found an upper bound for the error in total variation (TV) distance between and the ergodic measure of . Durmus and Moulines [14] established geometric ergodicity in TV distance for Langevin diffusion under similar convexity and Lipschitz conditions, with explicit convergence rates. Recently, Fan et al. [15] established normalized and self-normalized Cramér-type moderate deviations for the EM scheme for the SDE (1) on with . Meanwhile, the geometric ergodicity of the ULA towards its invariant probability measure under appropriate distance has been rarely studied so far in the literature. As an extension of classical Markov chains with discrete state space, the EM scheme studied in this paper is a non-atomic Markov chain, which is also of independent interest for the study on other stochastic models with a non-independence structure.
The objectives of this work are to prove the geometric ergodicity of the EM scheme given by (6) for the SDE (1) under TV distance, and provide furthermore a convergence rate to its invariant probability measure.
Let be the Borel -algebra on . From (6), it can be seen that is a Markov chain on the continuous state space , with Markov kernel given by
for any and . From (7), admits a kernel density with respect to (w.r.t) the Lebesgue measure given by . The Markov kernel can be defined equivalently as, for any and measurable function h on ,
Let us introduce now TV norm and TV distance respectively. Let be a measurable space. Consider the set of all bounded and measurable functions from to . For any finite signed measure on , the total variation norm of is defined by
where . For any two probability measures and on , the total variation distance between and is defined by
Throughout the paper, sometimes supplied with some indices, and c denote positive constants, whose value may vary from line to line. Subsequent symbols with the prefix will be redefined according to specific scenarios and are independent of each other. For any , and . When we write “C is an ()-small set”, it will be always assumed that and is a probability measure.
The paper is organized as follows. Section 2 derives some basic properties (Proposition 1) and existence and uniqueness of the invariant probability measure (Theorem 1) of the EM scheme . Section 3 obtains the convergence rate of the chain towards under TV distance (Theorem 2), through demonstrating furthermore the equivalent conditions for its uniform geometric ergodicity (Proposition 2). To prove Proposition 2, we use the splitting construction approach, which is described in Section 4. In Section 5, we discuss some connections and special highlights of the present work with classical ergodic theory for Markov chains on general state space, and some future research directions. In the Appendix, some known and useful properties of non-atomic and atomic Markov kernels are collected respectively in Appendix A and Appendix B. In Appendix C, we state some auxiliary results.
2. Existence and Uniqueness of Invariant Probability Measure
Consider the EM scheme defined by (6) with Markov kernel given by (7). In the sequel, let denote the probability measure on the canonical space of the chain , with the initial state . And denotes the expectation under the probability measure .
Hypothesis (H2).
For any and , .
We have the following basic property about the Markov chain and its kernel . Proposition 1 (1) below provides a sufficient condition for the existence of accessible -small set C satisfying .
Proposition 1.
- (1)
- If C is a compact subset of such that , then C is an accessible -small set, where, and is the probability density function of standard normal distribution.
- (2)
- For any , the Markov kernel is irreducible and strongly aperiodic.
- (3)
- Under Hypothesis (H2), the state space of the Markov chain is an 1-small set.
Proof.
- (1)
- Suppose that C is a compact subset of such that . Recall that admits a Markov kernel , given byThen for all and ,where is defined in (9). Evidently, C is an -small set, with . Furthermore, C is accessible since for all ,
- (2)
- We have proved in (1) that any compact subset C of satisfying is an accessible -small set with . Hence, is irreducible and strongly aperiodic.
- (3)
- Assume Hypothesis (H2). Then we have that for a given non-empty set , both and exist in ; for a given ,Let denote the function in the middle of the two inequalities above. Then for all and ,where is a Borel measure defined on . Therefore, the state space is an -small set.
□
If C is a subset of , let and denote respectively the first hitting time and the first return time of C for the chain , i.e.,
For a given , set
where L, and c are given from (2), (3) and (5) respectively. Consider a function defined by
By Lemma A6 (1) in Appendix C, there exists a constant depending only on and L, such that for any , . So by (10), we have for ,
For , consider the sets defined as follows
and
Define a function by
We have the following lemma. The inequality (12) below shows that for any initial state , the quantity is bounded from above uniformly in .
Lemma 1.
Under Hypothesis (H1), the following results hold.
- (1)
- For any , is an accessible -small set with .
- (2)
- There exists a constant depending only on and L, such that for any and ,where is a constant depending on η.Furthermore, for any and ,where , and .
Proof.
- (1)
- Since for any , is a compact subset of and , from Proposition 1 (1), we have that for any , is an accessible -small set, with , and , so that .
- (2)
- Using (5), (6) and the first inequality of (4), we can prove (see also (A.2) in [16]) that for any and , the following inequality holdsThen according to Proposition 4.3.3 (ii) in [17], we have for any and ,where .Applying Lemma A6 (1) in Appendix C again, since is decreasing in , we have for any , ; from Lemma A6 (2) in Appendix C, , so . Therefore, by (14), we come to the result (12).
□
Using the lemma above, we can obtain the following theorem, which shows the convergence of the kernel to its invariant probability measure under TV distance, for any initial probability measure on .
Theorem 1.
Under Hypothesis (H1), there exists a constant depending only on and L, such that for any , the Markov kernel has a unique invariant probability measure . Furthermore, there exist constants , , and an accessible -small set (all depending only on and L) with , such that
and for any initial probability measure ξ on ,
Proof.
From Lemma 1, we have that is an accessible -small set with and there exists such that (15) holds. Applying Theorem 11.4.2 from [17] to the accessible -small set , we can obtain immediately the existence and uniqueness of the invariant probability measure for the Markov kernel and there exist constants and (both depending only on and L) such that for any initial probability measure on , (16) holds. □
Example 1
(AR(1) process). For the existence and uniqueness of invariant probability measure in Theorem 1, one can take a simple example as follows. Let , for ; and . We can see that Hypothesis (H1) is satisfied in this case. The model (6) becomes
which is an model. Iterating (17), we have
where . Let be a standard normal random variable independent with . Consider the random variable , for any . Since , using martingale convergence theorem, we can obtain a.s., where . Let be the probability distribution of . Then we have that is the unique invariant probability measure for .
Remark 1.
Theorem 1 improves the result in Lemma 2.3 of [16] in the following two aspects. It shows not only the existence of invariant probability measure , but also the uniqueness under the same conditions, by introducing the accessible small set . It establishes furthermore the geometric rate of convergence of towards under TV distance for any initial probability measure ξ on , as . See also the corollary below.
Corollary 1.
Under Hypothesis (H1), there exist constants and depending only on and L, such that for any initial probability measure ξ on and ,
3. Geometric Rate of Convergence and Uniform Geometric Ergodicity of the Kernel
Let P be a Markov kernel on . The Markov kernel P is said to satisfy the geometric drift condition (see also Definition 14.1.5, [17]) , if is a measurable function, , and
We obtain the following geometric rate of convergence for the Markov kernel to its invariant probability measure , for any initial state .
Theorem 2.
Under Hypotheses (H1) and (H2), for any , there exist and such that for any ,
and
To prove the theorem above, we will need the following proposition, which gives equivalent conditions for uniform geometric ergodicity of .
Proposition 2.
For any , the following statements are equivalent.
- (1)
- is uniformly geometrically ergodic, i.e., admits an invariant probability measure such that there exist and satisfying for all ,
- (2)
- is positive, aperiodic, and there exist a small set C and a constant such that
- (3)
- The state space is small.
Proof.
(1) ⟹ (2). Suppose that is uniformly geometrically ergodic. We prove firstly that is irreducible; then as has an invariant probability measure , is thus positive. Moreover, by (21), there exist and such that for any , and , we have
Therefore, for any , and ,
If , we can choose n to be large enough such that , which implies that is irreducible.
Let C be an accessible small set. For , define set . Since is an invariant probability measure, we get and for all we can choose n to be large enough such that
Therefore, for all , is also a small set by Lemma A1, Appendix A.
Since and , we may choose to be large enough so that for all . Since is an invariant probability measure of , the set is accessible, for any . Applying (23) for , we may find n to be large enough such that for any ,
This implies that the period of is 1 and is thus aperiodic.
On the one hand, letting in (22), one gets for any and ,
We can thus choose to be large enough such that
As a result, satisfies the geometric drift condition , i.e., . Now, set
Let . Then we have
On the other hand, by (24), we have for any ,
thus satisfies the geometric drift condition , for some , and a measurable and bounded function on .
Let , for . From (25), for any and ,
Moreover, from the above, we have for all , the set is small; and for all , the set becomes accessible. Therefore, these are also true for the set . Choose . Consider a set , where ; and hence C is accessible and small. For , (26) yields . While, for , and (26) imply
Equivalently, for any ,
From the last inequality, with measurable functions and , some given and set C, we get for any ,
According to (14.1.4) in Proposition 14.1.2 [17], for any ,
where by convention on the right-hand side of the inequality. Using (27), we obtain
Therefore, for any ,
where . Moreover, for any ,
(2) ⟹ (3). For any , consider the set defined by
We will firstly prove that is small, for any . Note that
and the union of two small sets remains small for irreducible and aperiodic kernel . So it suffices to prove that both and are small. Since C is small and , it is evident that is also small. Suppose . By Markov’s inequality, for all ,
Thus, for k that is sufficiently large,
Therefore, the set C is uniformly accessible from . Since is irreducible, according to Lemma A4 (1) in Appendix A, we have that is small.
Since
there exists such that , which is small from above. Therefore, the state space is small.
(3) ⟹ (1). Suppose that the state space is small set. We will firstly show that is irreducible, recurrent and positive. Since is small, there exists and nonzero measure on such that for all and ,
which implies for all such that , one has . Consequently, is irreducible. Since is an accessible small set, -a.s., for all . Applying Lemma A4 (2) in Appendix A, we have that is recurrent. According to Theorem 11.2.5 in [17], admits an invariant probability measure satisfying for every accessible set C; since is accessible, this implies , showing that is positive.
Next, we will prove that is aperiodic by contradiction. Suppose that is an irreducible Markov kernel with period . According to Lemma A3 in Appendix A, there exist , , ⋯, of mutually disjoint accessible sets such that for , and for any , and hence
where additions are in the modulo sense, and is absorbing. Therefore, there exists such that
which contradicts with (30).
Finally, we can obtain (21) by applying Proposition 3 below, with . □
Remark 2.
From the proof above, we can see that the uniform geometric ergodicity of is connected to geometric drift condition (18). This allows us to control the quantity in the statement (2) and thus obtain the result in the statement (3).
Proposition 3.
For any , suppose that admits an -small set C with . Assume that for some ,
Then there exists a constant such that for all initiate distributions ξ on ,
The proof of the proposition above will be given in the next section.
4. Splitting Construction and Split Markov Kernel
Let and be a measurable space. In this section, based on the kernel , we will construct a new Markov kernel on the extended state space . The detailed method of splitting construction for more general case can be found in Section 11.1 of [17].
Without loss of generality, we assume that admits an -small set C with and . Let be the Bernoulli distribution with success probability , given by
For any bounded and measurable function f on , define a function on by
From the definition of above, we have for any measure on ,
For , consider the residual kernel defined for and by
Now, for , define the split Markov kernel on as follows. For and , set
where is the Markov kernel on defined for all by
Equivalently, for all bounded and measurable function g on , one has
where is the kernel density of . It follows that for any bounded and measurable function f on ,
Let us describe now the canonical chain associated with the kernel on . For probability measure on , denote by the probability measure on the canonical space such that the coordinate process, denoted by and called split chain, is a Markov chain with initial distribution and Markov kernel .
From the splitting construction above, is a sequence of i.i.d Bernoulli random variables with success probability that is independent of . Denote by the natural filtration of the process . An important property of the split chain is that if and are independent, then is a Markov chain with kernel .
For a given , suppose that admits an -small set C. We have the following lemmas: Lemmas 2–4.
Lemma 2.
For any non-negative measure ξ on ,
Lemma 3.
For any probability measures on , is under a Markov chain on with initial distribution ξ and Markov kernel .
Lemma 4.
If is a non-negative measure on and is -invariant, then , where is a non-negative measure on , defined by
In addition, is -invariant.
For a given , suppose that admits an -small set C with . We can obtain the following properties: Lemmas 5 and 6.
Lemma 5.
Set and . Then the following results are true:
- (1)
- The set is an aperiodic atom for the kernel .
- (2)
- The set is small for the kernel .
- (3)
- If C is accessible, then the atom is accessible for , and hence is irreducible.
- (4)
- For all , .
- (5)
- If C is Harris recurrent for , then for any probability measure ξ on satisfying , for all . Moreover, if is Harris recurrent, then is Harris recurrent.
- (6)
- If C is accessible and admits an invariant probability measure , then is positive for .
Lemma 6.
Assume that for some ,
Then:
- (1)
- There exist constants and such thatand for any non-negative measure ξ on ,
- (2)
- admits a unique invariant probability measure , where is the unique invariant probability measure of .
Proof.
- (1)
- The condition (33) implies thatso the set C is Harris recurrent (see also Proposition 4.2.5 (ii), [17]). By Lemma 5 (5), for all , and . So we have for all and ,which implies that for any and ,On the other hand, for any , we have by Lemma 3,Note that for any positive random variable Y,with . Applying the above inequality to , and combining (38) and the condition (33), we getSimilar to (36), we can obtainCombining (41) and (40), we obtainBy Lemma 5 (5), . Applying Theorem 14.2.3 in [17] with , , and , and using (39), we get there exist , such thatConsider the shift operator T, defined by , for any . Define inductively as the identity function, i.e., , for ; and , for . Notice that on the event and using Lemma 3, we get
- (2)
- Let be fixed. From Proposition 1 (2), is irreducible and aperiodic. By Lemma A2 in Appendix A and the condition (33), the small set C is accessible. The condition (33) implies that . From Lemma A4 (3) in Appendix A, we have is positive. Thus by Lemma 5, is accessible, aperiodic, and positive atom for the split kernel . Using the inequality (34), the condition (33) implies that there exists such thatApplying Theorem 11.4.2 in [17] to , we get it has a unique invariant probability measure , which is expressed as by Lemma 4, where is the unique invariant probability measure for .
□
- Using the lemmas above, we can prove Proposition 3 as follows.
Proof of Proposition 3.
Lemma 2 implies for ,
So we have
In Lemma 6, it is proven that is an accessible, aperiodic, and positive atom for , which admits unique invariant probability measure ; moreover, it is proven that (42) is true. Now, applying Lemma A5 in Appendix B to with , we obtain that there exist and such that
5. Conclusions
This work investigates the convergence rate of EM scheme to the invariant measure under total variation distance for solution approximations of SDE given by (1). To this end, the ergodic properties of the EM scheme, as a non-atomic Markov chain, are studied. It turns out that under Hypothesis (H1), is irreducible, strongly aperiodic (see also Proposition 1), and admits a unique invariant probability measure (see also Theorem 1). If in addition Hypothesis (H2) is satisfied, is uniformly geometrically ergodic, and converges to under TV distance at least in geometric rate, which is independent of the step size (see also Theorem 2). To show the uniform geometric ergodicity of the chain, we studied its equivalent conditions (see also Proposition 2) with the approach of splitting construction.
Let us describe some connections and special highlights of the present work with classical ergodic theory for Markov chains on general state space. In the book of Meyn and Tweedie [18], the theory on geometric ergodicity for -irreducible Markov chain, with Markov kernel P and state space X, is introduced in Chapter 15. Our geometric ergodicity results in Theorem 1 are similar to those under f-norm in Theorem 15.4.1 of [18], when . Their results hold under the following “Minorization Condition” of the chain: for some , some and some probability measure with and ,
Meanwhile, our geometric ergodicity results in Theorem 1, obtained by using Theorem 11.4.2 in [17], only require the condition of existence of an -small set D, with and , which is ensured in our case because it is shown in Proposition 3.1 (3) that the state space is small. In this article, we applied a new splitting construction approach introduced by Dedecker and Gouëzel [19], which is different from the two classical splitting approaches in [18]: Nummelin splitting technique, due to [20], and random renewal time approach, due to [21]. Thanks to this new splitting construction, it makes our proof of the equivalent conditions for the uniform geometric ergodicity of in Proposition 2 differ from the proof of the existing similar results in Theorems 16.0.2 and 16.2.2 of [18]. Moreover, due to this new approach, we have managed to establish an important link between 1-geometrically recurrent small set as described in (31) and the convergence of the series involving TV norm in (32) for the Markov kernel .
With the new concepts related to non-atomic Markov chains, our results provide further properties for an EM scheme with constant step size of SDEs. In the future, EM scheme with non-constant step sizes and algorithm with high performance such as convergence rate in a controlled manner, can be considered for applications. Also, the convergence behavior of the EM scheme in higher-dimensional spaces under different distances can be considered as a future research direction.
Author Contributions
Conceptualization, Y.Y.; Methodology, Y.Y.; Formal analysis, Y.Y. and Y.W.; Writing—original draft, Y.Y. and Y.W.; Writing—review and editing, Y.W. and Y.Y.; supervision, Y.Y.; project administration, Y.Y. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
No new data were created or analyzed in this study.
Conflicts of Interest
The authors declare no conflicts of interest.
Appendix A. Some Properties Related to Small Sets and Irreducible Markov Kernels
In this section, we will introduce some basic properties related to Markov kernels that admit accessible small sets. Readers may refer to Chapter 9 in the book of Douc et al. [17] for the details.
Suppose that is a Markov chain living on the state space X, with Markov kernel P on a measurable space , where is a -algebra generated by X. In the sequel, let denote the probability measure on the canonical space of the chain , with the initial state . And denotes the expectation under the probability measure . If , let denote the number of visits of to the set B, defined as . Define respectively the first return time of the set B and the expected number of visits to B starting from x by
and
Definition A1
(Accessible set and uniform accessibility, [17]).
- (1)
- A set is said to be accessible if for all , there exists an integer such that .
- (2)
- A set B is uniformly accessible from A, if there exists such that
Definition A2
(Full set, [17]). A set is said to be full if is not accessible.
Definition A3
(Atom and small set, [17]).
- (1)
- A set is called an atom, if there exists a probability measure ν on on such that for all and ,
- (2)
- A set is called a small set if there exists positive integer m and a nonzero measure μ on such that for all and ,Then the set C is said to be an -small set.
Remark A1.
- (1)
- From the definition above, it can be seen that atom is a particular small set satisfying the equality in (A1) with and , where μ becomes a probability measure.
- (2)
Definition A4
(Irreducible kernel, [17]). A Markov kernel P is said to be irreducible if it admits an accessible small set.
Definition A5
(Recurrent and Harris recurrent, [17]).
- (1)
- A set is said to be recurrent if for all ; it is said to be Harris recurrent if , for all .
- (2)
- The kernel P is said to be recurrent if every accessible set is recurrent; it is said to be Harris recurrent if every accessible set is Harris recurrent.
Definition A6
(Strongly aperiodic small set, [17]). An -small set C is said to be strongly aperiodic, if and .
Definition A7
(Period, aperiodicity and strong aperiodicity [17]).
- (1)
- The common period of all accessible small sets is called the period of the kernel P.
- (2)
- If the period is equal to 1, the kernel P is said to be aperiodic.
- (3)
- If there exists an accessible -small set C with , the kernel P is said to be strongly aperiodic.
Definition A8
(Positive and null recurrent atom, positive and null Markov kernel, [17]).
- (1)
- An atom α is said to be positive, if ; it is said to be null recurrent, if it is recurrent and .
- (2)
- If P is irreducible and admits an invariant probability measure π, the Markov kernel P is called positive. If P does not admit such a measure, then P is called null.
Definition A9
(Uniformly geometrically ergodic, [17]). A Markov kernel P on is said to be uniformly geometrically ergodic, if it admits an invariant probability measure π such that there exist and satisfying for any and any ,
Definition A10
(Invariant measure, [17]). A nonzero measure μ is said to be invariant if it is σ-finite and .
The lemmas below are useful to prove Proposition 2.
Lemma A1
(Lemma 9.1.7 (ii), [17]). Let C be an -small set and . If there exists such that , then D is an -small set.
Lemma A2
(Corollary 9.2.14, [17]). Suppose that P is irreducible. Let r be a positive increasing sequence such that and , . Assume that . Then the set
is full and absorbing, and A is accessible.
Lemma A3
(Theorem 9.3.6, [17]). Suppose that P is an irreducible Markov kernel with period d. Then there exists a sequence of mutually disjoint accessible sets such that for and , . Consequently, is absorbing.
Lemma A4.
Suppose that P is irreducible and aperiodic. Then the following statements are true.
- (1)
- Let C, . If D is small and uniformly accessible from C, then C is also small.
- (2)
- P is recurrent if and only if it admits an accessible recurrent small set.
- (3)
- If there exists a small set C, such that , then P is positive.
The statements (1), (2) and (3) above can be proved by applying Lemma 9.4.7 (ii) and Theorem 9.4.10, Theorem 10.1.2 and Theorem 9.4.10, Corollary 11.2.9 and Theorem 9.4.10 respectively in [17].
Appendix B. Rate of Convergence in TV Norm for Atomic Markov Chains
Suppose now that is an atom for the kernel P. If a function h defined on X is constant on , then we write instead of for all . With this convention, for every positive -measurable random variable Y such that is constant on , we write instead of , for any .
The following result shows the convergence rate of to its invariant probability measure under TV norm, if the atom is 1-geometrically recurrent (see also Definition 14.4.1, [17]).
Lemma A5.
Let α be an accessible, aperiodic, and positive atom. Denote by π the unique invariant probability measure. Assume that there exists such that
Then there exist and a constant such that for every probability measure ξ on ,
The lemma above can be obtained by applying Theorem 13.4.3 in [17] with therein.
Appendix C. Some Auxiliary Result
Recall that
In this part, we will conduct an analysis on the functions and defined respectively as follows. For any , and
We have the following result.
Lemma A6.
- (1)
- There exists a constant depending only on and L such that for all , the function is decreasing and .
- (2)
- The function is decreasing on .
References
- Bencheikh, O.; Jourdain, B. Convergence in total variation of the Euler–Maruyama scheme applied to diffusion processes with measurable drift coefficient and additive noise. SIAM J. Numer. Anal. 2022, 60, 1701–1740. [Google Scholar] [CrossRef] [Scilit]
- Bras, P.; Pagès, G.; Panloup, F. Total variation distance between two diffusions in small time with unbounded drift: Application to the Euler-Maruyama scheme. Electron. J. Probab. 2022, 27, 1–19. [Google Scholar] [CrossRef] [Scilit]
- Huang, X.; Liao, Z.W. The Euler-Maruyama method for S(F)DEs with Hölder drift and α-stable noise. Stoch. Anal. Appl. 2018, 36, 28–39. [Google Scholar] [CrossRef] [Scilit]
- Kühn, F.; Schilling, R.L. Strong convergence of the Euler-Maruyama approximation for a class of Lévy-driven SDEs. Stoch. Process. Their Appl. 2019, 129, 2654–2680. [Google Scholar] [CrossRef] [Scilit]
- Li, Y.; Zhao, G. Euler-Maruyama scheme for SDE driven by Lévy process with Hölder drift. Stat. Probab. Lett. 2024, 215, 110220. [Google Scholar] [CrossRef] [Scilit]
- Pamen, O.M.; Taguchi, D. Strong rate of convergence for the Euler-Maruyama approximation of SDEs with Hölder continuous drift coefficient. Stoch. Process. Their Appl. 2017, 127, 2542–2559. [Google Scholar] [CrossRef] [Scilit]
- Panloup, F. Recursive computation of the invariant measure of a stochastic differential equation driven by a Lévy process. Ann. Appl. Probab. 2008, 18, 379–426. [Google Scholar] [CrossRef] [Scilit]
- Protter, P.; Talay, D. The Euler scheme for Lévy driven stochastic differential equations. Ann. Probab. 1997, 25, 393–423. [Google Scholar] [CrossRef] [Scilit]
- Brooks, S.; Gelman, A.; Jones, G.L.; Meng, X.L. Handbook of Markov Chain Monte Carlo, 1st ed.; Chapman and Hall/CRC: Boca Raton, FL, USA, 2011. [Google Scholar]
- Ding, Z.; Li, Q. Langevin Monte Carlo: Random coordinate descent and variance reduction. J. Mach. Learn. Res. 2021, 22, 1–51. [Google Scholar]
- Max, W.; Yee, W.T. Bayesian learning via stochastic gradient Langevin dynamics. In Proceedings of the The 28th International Conference on Machine Learning, Bellevue, WA, USA, 28 June–2 July 2011. [Google Scholar]
- Roberts, G.O.; Tweedie, R.L. Exponential convergence of Langevin distributions and their discrete approximations. Bernoulli 1996, 2, 341–363. [Google Scholar] [CrossRef] [Scilit]
- Dalalyan, A.S. Theoretical guarantees for approximate sampling from smooth and log-concave densities. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 2017, 79, 651–676. [Google Scholar]
- Durmus, A.; Moulines, É. Nonasymptotic convergence analysis for the unadjusted Langevin alorithm. Ann. Appl. Probab. 2017, 27, 1551–1587. [Google Scholar]
- Fan, X.; Hu, H.; Xu, L. Normalized and self-normalized Cramér-type moderate deviations for the Euler-Maruyama scheme for the SDE. Sci. China Math. 2024, 67, 1865–1880. [Google Scholar] [CrossRef] [Scilit]
- Lu, J.; Tan, Y.; Xu, L. Central limit theorem and self-normalized Cramér-type moderate deviation for Euler-Maruyama scheme. Bernoulli 2022, 28, 937–964. [Google Scholar] [CrossRef] [Scilit]
- Douc, R.; Moulines, E.; Priouret, P.; Soulier, P. Markov Chains, 1st ed.; Springer: Berlin/Heidelberg, Germany, 2018. [Google Scholar]
- Meyn, S.P.; Tweedie, R.L. Markov Chains and Stochastic Stability, 2nd ed.; Cambridge University Press: Cambridge, UK, 2009. [Google Scholar]
- Dedecker, J.; Gouëzel, S. Subgaussian concentration inequalities for geometrically ergodic Markov chains. Electron. Commun. Probab. 2015, 20, 1–12. [Google Scholar] [CrossRef] [Scilit]
- Nummelin, E. General Irreducible Markov Chains and Non-Negative Operators; Cambridge University Press: Cambridge, UK, 1984. [Google Scholar]
- Athreya, K.B.; Ney, P. A New approach to the limit theory of recurrent Markov chains. Trans. Am. Math. Soc. 1978, 245, 493–501. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.