Skip to Content
EntropyEntropy
  • Article
  • Open Access

14 June 2026

Convergence Rate of Euler–Maruyama Scheme to the Invariant Probability Measure Under Total Variation Distance for the SDEs

and
1
School of Mathematics and Statistics, Northeastern University at Qinhuangdao, Qinhuangdao 066004, China
2
Department of Applied Mathematics, School of Mathematics and Physics, Xi’an Jiaotong-Liverpool University, Suzhou 215123, China
*
Author to whom correspondence should be addressed.
This article belongs to the Special Issue Convergence Rates for Markov Chains

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.

1. Introduction

Consider the following stochastic differential equation (SDE) on R :
d X t = g ( X t ) d t + σ d B t , X 0 = x 0 ,
where ( B t ) t 0 is a standard Brownian motion, σ > 0 is a constant, and g : R R satisfies the hypothesis below.
Hypothesis (H1).
There exist L, K 1 > 0 and K 2 0 such that for every ( x , y ) R 2 ,
| g ( x ) g ( y ) | L | x y | ,
( g ( x ) g ( y ) ) ( x y ) K 1 ( x y ) 2 + K 2 .
Moreover, g is second-order differentiable, and the second-order derivative of g is bounded.
The inequality (2) implies for any x R ,
g 2 ( x ) 2 L 2 x 2 + 2 g 2 ( 0 ) , | g ( x ) | L ,
where g represents the derivative of the function g. Moreover, the inequality (3) and Young’s inequality imply
x g ( x ) K 1 2 x 2 + c g ,
with c g = K 2 + 1 2 K 1 g 2 ( 0 ) .
For a given step size η ( 0 , 1 ) , the Euler–Maruyama (EM) scheme ( θ k ) k 0 for the SDE (1) is given by the following recursive relation: for any k 0 ,
θ k + 1 = θ k + η g ( θ k ) + η σ ε k + 1 ,
where ( ε k ) k 1 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 R d with d 1 (see for instance [1,2,3,4,5,6,7,8]). In the case when g ( x ) = U ( x ) 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 θ k and the ergodic measure of ( X t ) t 0 . 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 R d with d 1 . 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 B ( R ) be the Borel σ -algebra on R . From (6), it can be seen that ( θ k ) k 0 is a Markov chain on the continuous state space R , with Markov kernel P η given by
P η ( x , A ) = 1 2 π η σ A exp ( y x η g ( x ) ) 2 2 η σ 2 d y ,
for any x R and A B ( R ) . From (7), P η admits a kernel density with respect to (w.r.t) the Lebesgue measure given by p η ( x , y ) : = 1 2 π η σ exp ( y x η g ( x ) ) 2 2 η σ 2 . The Markov kernel P η can be defined equivalently as, for any x R and measurable function h on R , B ( R ) ,
P η h ( x ) : = R h ( y ) p η ( x , y ) d y .
Let us introduce now TV norm · T V and TV distance d T V respectively. Let ( X , X ) be a measurable space. Consider F b the set of all bounded and measurable functions from ( X , X ) to R . For any finite signed measure ξ on ( X , X ) , the total variation norm of ξ is defined by
ξ T V : = sup ξ ( f ) | f F b , | f | 1 ,
where | f | : = sup | f ( x ) | | x X . For any two probability measures ξ and ξ on ( X , X ) , the total variation distance between ξ and ξ is defined by
d T V ( ξ , ξ ) : = 1 2 ξ ξ T V .
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 ( a , b ) R 2 , a b = max { a , b } and a b = min { a , b } . When we write “C is an ( m , ε ν )-small set”, it will be always assumed that ε ( 0 , 1 ] 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 ( θ k ) k 0 . Section 3 obtains the convergence rate of the chain ( θ k ) k 0 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 ( θ n ) n 0 defined by (6) with Markov kernel P η given by (7). In the sequel, let P x denote the probability measure on the canonical space R N , B ( R ) N of the chain ( θ n ) n 0 , with the initial state θ 0 = x . And E x denotes the expectation under the probability measure P x .
Hypothesis (H2).
For any x R and η ( 0 , 1 ) , | x + η g ( x ) | c .
We have the following basic property about the Markov chain ( θ n ) n 0 and its kernel P η . Proposition 1 (1) below provides a sufficient condition for the existence of accessible ( 1 , μ ) -small set C satisfying μ ( C ) > 0 .
Proposition 1.
(1) 
If C is a compact subset of R such that L e b ( C ) > 0 , then C is an accessible ( 1 , ϵ ν ) -small set, where
ϵ : = L e b ( C ) η σ inf ( x , y ) C 2 ϕ y x η g ( x ) η σ ,
ν ( · ) : = L e b ( · C ) / L e b ( C ) , and ϕ ( x ) : = 1 2 π exp { x 2 / 2 } is the probability density function of standard normal distribution.
(2) 
For any η ( 0 , 1 ) , the Markov kernel P η is irreducible and strongly aperiodic.
(3) 
Under Hypothesis (H2), the state space R of the Markov chain ( θ k ) k 0 is an 1-small set.
Proof. 
(1)
Suppose that C is a compact subset of R such that Leb ( C ) > 0 . Recall that P η admits a Markov kernel p η ( x , y ) , given by
p η ( x , y ) = 1 η σ ϕ y x η g ( x ) η σ .
Then for all x C and A B ( R ) ,
P η ( x , A ) = A p η ( x , y ) d y A C p η ( x , y ) d y ϵ Leb ( A C ) Leb ( C ) ,
where ϵ ( 0 , 1 ] is defined in (9). Evidently, C is an ( 1 , ϵ ν ) -small set, with ν ( · ) = Leb ( · C ) / Leb ( C ) . Furthermore, C is accessible since for all x R ,
P η ( x , C ) = 1 η σ C ϕ y x η g ( x ) η σ d y > 0 .
(2)
We have proved in (1) that any compact subset C of R satisfying Leb ( C ) > 0 is an accessible ( 1 , μ ) -small set with μ ( C ) = ϵ ν ( C ) > 0 . Hence, P η is irreducible and strongly aperiodic.
(3)
Assume Hypothesis (H2). Then we have that for a given non-empty set A B ( R ) , both inf x R ( x + η g ( x ) ) and sup x R ( x + η g ( x ) ) exist in R ; for a given y A ,
inf x R p η ( x , y ) 1 2 π η σ exp 1 2 η σ 2 y inf x R ( x + η g ( x ) ) 2 y sup x R ( x + η g ( x ) ) 2 > 0 .
Let f ( y ) denote the function in the middle of the two inequalities above. Then for all x R and A B ( R ) ,
P η ( x , A ) = A p η ( x , y ) d y μ ( A ) ,
where μ ( A ) = A f ( y ) d y is a Borel measure defined on B ( R ) . Therefore, the state space R is an ( 1 , μ ) -small set.
If C is a subset of R , let τ C and σ C denote respectively the first hitting time and the first return time of C for the chain ( θ n ) n 0 , i.e.,
τ C = inf { n 0 | θ n C } ,
σ C = inf { n 1 | θ n C } .
For a given η ( 0 , 1 ) , set
b η : = 2 g 2 ( 0 ) L 2 η 2 + 1 2 K 1 + σ 2 + 2 c η ,
where L, K 1 and c are given from (2), (3) and (5) respectively. Consider a function λ ( η ) defined by
λ ( η ) : = 1 1 2 K 1 η + 2 L 2 η 2 , η ( 0 , 1 ) .
By Lemma A6 (1) in Appendix C, there exists a constant η 0 ( 0 , 1 ) depending only on K 1 and L, such that for any η ( 0 , η 0 ] , 0 < λ ( η ) < 1 . So by (10), we have for η ( 0 , η 0 ] ,
b η = 1 λ ( η ) + 2 g 2 ( 0 ) η 2 + σ 2 η + 2 c η > 0 .
For η ( 0 , η 0 ] , consider the sets defined as follows
D η : = x R | | x | 2 b η K 1 η 2
and
B η : = x R | | x | 2 b η K 1 η .
Define a function V ( x ) by
V ( x ) : = 1 + x 2 , x R .
We have the following lemma. The inequality (12) below shows that for any initial state x R , the quantity E x β η σ D η is bounded from above uniformly in η .
Lemma 1.
Under Hypothesis (H1), the following results hold.
(1) 
For any η ( 0 , 1 ) , D η is an accessible ( 1 , μ ) -small set with μ ( D η ) > 0 .
(2) 
There exists a constant η 0 ( 0 , 1 ) depending only on K 1 and L, such that for any η ( 0 , η 0 ] and x R ,
E x β η σ D η V ( x ) + b η β η ,
where β η > 1 is a constant depending on η.
Furthermore, for any η ( 0 , η 0 ] and x R ,
E x β η σ D η E x β 0 σ D 0 V ( x ) + b 0 β 0 ,
where D 0 : = D η 0 , β 0 : = β η 0 and b 0 : = b η 0 .
Proof. 
(1)
Since for any η ( 0 , 1 ) , D η is a compact subset of R and Leb ( D η ) = 4 b η K 1 η 2 > 0 , from Proposition 1 (1), we have that for any η ( 0 , 1 ) , D η is an accessible ( 1 , μ ) -small set, with μ = ϵ ν , ϵ ( 0 , 1 ] and ν ( D η ) = 1 > 0 , so that μ ( D η ) > 0 .
(2)
Using (5), (6) and the first inequality of (4), we can prove (see also (A.2) in [16]) that for any η ( 0 , 1 ) and x R , the following inequality holds
P η V ( x ) λ ( η ) V ( x ) + b η 1 B η ( x ) .
By (11), we have b η K 1 η < b η K 1 η 2 , for η ( 0 , η 0 ] . Consequently, B η D η and 1 B η 1 D η . From (13), we obtain
P η V ( x ) λ ( η ) V ( x ) + b η 1 D η ( x ) .
Then according to Proposition 4.3.3 (ii) in [17], we have for any η ( 0 , η 0 ] and x R ,
E x β η σ D η V ( x ) + b η β η ,
where β η = 1 / λ ( η ) > 1 .
Applying Lemma A6 (1) in Appendix C again, since λ ( η ) is decreasing in η , we have for any η ( 0 , η 0 ] , β η β 0 ; from Lemma A6 (2) in Appendix C, D 0 D η , so max η ( 0 , η 0 ] σ D η σ D 0 . 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 P η to its invariant probability measure π η under TV distance, for any initial probability measure ξ on ( R , B ( R ) ) .
Theorem 1.
Under Hypothesis (H1), there exists a constant η 0 ( 0 , 1 ) depending only on K 1 and L, such that for any η ( 0 , η 0 ] , the Markov kernel P η has a unique invariant probability measure π η . Furthermore, there exist constants δ > 1 , τ < , β 0 > 1 and an accessible ( 1 , μ ) -small set D 0 (all depending only on K 1 and L) with μ ( D 0 ) > 0 , such that
sup x D 0 E x β 0 σ D 0 < ,
and for any initial probability measure ξ on ( R , B ( R ) ) ,
n = 1 + δ n d T V ( ξ P η n , π η ) τ E ξ β 0 σ D 0 .
Proof. 
From Lemma 1, we have that D 0 is an accessible ( 1 , μ ) -small set with μ ( D 0 ) > 0 and there exists β 0 > 1 such that (15) holds. Applying Theorem 11.4.2 from [17] to the accessible ( 1 , ε ν ) -small set D 0 , we can obtain immediately the existence and uniqueness of the invariant probability measure π η for the Markov kernel P η and there exist constants δ > 1 and τ < (both depending only on K 1 and L) such that for any initial probability measure ξ on ( R , B ( R ) ) , (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 g ( x ) : = 1 1 η x , for x R ; and σ = 1 . We can see that Hypothesis (H1) is satisfied in this case. The model (6) becomes
θ k + 1 = η θ k + η ε k + 1 , k 0 ,
which is an A R ( 1 ) model. Iterating (17), we have
θ k = η k θ 0 + A k , k 1 ,
where A k : = η i = 0 k 1 η i ε k i . Let ε 0 be a standard normal random variable independent with ( ε k ) k 1 . Consider the random variable B k : = η i = 0 k 1 η i ε i , for any k 1 . Since 0 < η < 1 , using martingale convergence theorem, we can obtain lim k + B k = B a.s., where B : = η i = 0 + η i ε i . Let π η be the probability distribution of B . Then we have that π η is the unique invariant probability measure for P η .
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 D 0 . It establishes furthermore the geometric rate of convergence of ξ P η n towards π η under TV distance for any initial probability measure ξ on ( R , B ( R ) ) , as n . See also the corollary below.
Corollary 1.
Under Hypothesis (H1), there exist constants δ > 1 and η 0 ( 0 , 1 ) depending only on K 1 and L, such that for any initial probability measure ξ on ( R , B ( R ) ) and η ( 0 , η 0 ] ,
d T V ξ P η n , π η = o δ n , a s n .

3. Geometric Rate of Convergence and Uniform Geometric Ergodicity of the Kernel P η

Let P be a Markov kernel on X × X . The Markov kernel P is said to satisfy the geometric drift condition (see also Definition 14.1.5, [17]) D g ( V , λ , b ) , if V : X [ 1 , ) is a measurable function, λ [ 0 , 1 ) , b [ 0 , ) and
P V ( x ) λ V ( x ) + b 1 X ( x ) .
We obtain the following geometric rate of convergence for the Markov kernel P η to its invariant probability measure π η , for any initial state x R .
Theorem 2.
Under Hypotheses (H1) and (H2), for any η ( 0 , 1 ) , there exist δ ( 1 , ] and τ < such that for any n N ,
sup x R P η n ( x , · ) π η T V τ δ n
and
sup x R d T V P η n ( x , · ) , π η τ / 2 δ n .
To prove the theorem above, we will need the following proposition, which gives equivalent conditions for uniform geometric ergodicity of P η .
Proposition 2.
For any η ( 0 , 1 ) , the following statements are equivalent.
(1) 
P η is uniformly geometrically ergodic, i.e., P η admits an invariant probability measure π η such that there exist δ > 1 and τ < satisfying for all n N ,
sup x R P η n ( x , · ) π η T V τ δ n .
(2) 
P η is positive, aperiodic, and there exist a small set C and a constant δ > 1 such that
sup x R E x δ σ C < .
(3) 
The state space R is small.
Proof. 
(1) ⟹ (2). Suppose that P η is uniformly geometrically ergodic. We prove firstly that P η is irreducible; then as P η has an invariant probability measure π η , P η is thus positive. Moreover, by (21), there exist β > 1 and M < such that for any n N , x R and A B ( R ) , we have
| P η n ( x , A ) π η ( A ) | P η n ( x , · ) π η T V M β n .
Therefore, for any n N , A B ( R ) and x R ,
P η n ( x , A ) π η ( A ) M β n .
If π η ( A ) > 0 , we can choose n to be large enough such that P η n ( x , A ) > 0 , which implies that P η is irreducible.
Let C be an accessible small set. For d > 0 , define set B d = { x R | 1 ( x ) d } . Since π η is an invariant probability measure, we get π η ( C ) > 0 and for all x B d we can choose n to be large enough such that
P η n ( x , C ) π η ( C ) M β n π η ( C ) / 2 .
Therefore, for all d > 0 , B d is also a small set by Lemma A1, Appendix A.
Since R = { x R | 1 ( x ) < } and π η ( R ) = 1 , we may choose d 0 to be large enough so that π η ( B d ) > 0 for all d d 0 . Since π η is an invariant probability measure of P η , the set B d is accessible, for any d d 0 . Applying (23) for A = B d , we may find n to be large enough such that for any m > n ,
inf x B d P η m ( x , B d ) π η ( B d ) / 2 > 0 .
This implies that the period of P η is 1 and P η is thus aperiodic.
On the one hand, letting A = R in (22), one gets for any k N and x R ,
P η k 1 ( x ) M β k + 1 .
We can thus choose m N * to be large enough such that
M β m λ < 1 .
As a result, P η m satisfies the geometric drift condition D g ( 1 , λ , 1 ) , i.e., P η m λ + 1 . Now, set
V 0 ( x ) : = 1 + λ 1 / m P η 1 ( x ) + + λ ( m 1 ) / m P η m 1 1 ( x ) , x R .
Let b : = λ ( m 1 ) / m . Then we have
P η V 0 ( x ) = P η 1 ( x ) + λ 1 / m P η 2 1 ( x ) + + λ ( m 1 ) / m P η m 1 ( x ) P η 1 ( x ) + λ 1 / m P η 2 1 ( x ) + + λ ( m 2 ) / m P η m 1 1 ( x ) + λ ( m 1 ) / m ( λ + 1 ) = λ 1 / m ( λ 1 / m P η 1 ( x ) + λ 2 / m P η 2 1 ( x ) + + λ ( m 1 ) / m P η m 1 1 ( x ) + 1 ) + b = λ 1 / m V 0 ( x ) + b .
On the other hand, by (24), we have for any x R ,
1 < V 0 ( x ) M k = 1 m 1 λ k / m β k + k = 0 m 1 λ k / m ( M + 1 ) k = 0 m 1 λ k / m = ( M + 1 ) λ 1 1 λ 1 / m 1 .
P η thus satisfies the geometric drift condition D g ( V 0 , λ 1 / m , λ ( m 1 ) / m ) , for some m N * , λ ( 0 , 1 ) and V 0 : R [ 1 , ) a measurable and bounded function on R .
Let f ( x ) : = ( λ ˜ λ 1 / m ) V 0 ( x ) , for λ ˜ ( λ 1 / m , 1 ) . From (25), for any λ ˜ ( λ 1 / m , 1 ) and x R ,
P η V 0 ( x ) + f ( x ) λ ˜ V 0 ( x ) + b .
Moreover, from the above, we have for all d > 0 , the set B d is small; and for all d d 0 , the set B d becomes accessible. Therefore, these are also true for the set { x R | V 0 ( x ) d } . Choose λ 1 ( λ ˜ , 1 ) . Consider a set C : = { x R | V 0 ( x ) d 1 } , where d 1 d 0 b ( λ 1 λ ˜ ) 1 ; and hence C is accessible and small. For x C , (26) yields P η V 0 ( x ) + f ( x ) < λ 1 V 0 ( x ) + b . While, for x C c , ( λ 1 λ ˜ ) V 0 ( x ) < b and (26) imply
P η V 0 ( x ) + f ( x ) < λ 1 V 0 ( x ) + b ( λ 1 λ ˜ ) V 0 ( x ) < λ 1 V 0 ( x ) .
Equivalently, for any x R ,
P η V 0 ( x ) + f ( x ) λ 1 V 0 ( x ) + b 1 C .
From the last inequality, with measurable functions V 0 : R [ 1 , ] and f : R [ 1 , ) , some given δ = λ 1 1 > 1 and set C, we get for any x C c ,
P η V 0 ( x ) + f ( x ) δ 1 V 0 ( x ) .
According to (14.1.4) in Proposition 14.1.2 [17], for any x R ,
λ 1 1 ( λ ˜ λ 1 / m ) E x k = 0 σ C 1 λ ˜ k V 0 ( X k ) λ 1 1 P η V 0 ( x ) + f ( x ) 1 C ( x ) + V 0 ( x ) 1 C c ( x ) ,
where 0 × = 0 by convention on the right-hand side of the inequality. Using (27), we obtain
λ 1 1 ( λ ˜ λ 1 / m ) E x k = 0 σ C 1 δ k V 0 ( X k ) ( sup C V 0 + b λ 1 1 ) 1 C ( x ) + V 0 ( x ) 1 C c ( x ) d 1 + b λ 1 1 + 1 V 0 ( x ) = ( d 1 + b δ + 1 ) V 0 ( x ) .
Therefore, for any x R ,
E x k = 0 σ C 1 δ k V 0 ( X k ) τ V 0 ( x ) ,
where τ : = [ ( d 1 + 1 ) δ 1 + b ] ( λ ˜ λ 1 / m ) 1 < . Moreover, for any x R ,
E x k = 0 σ C 1 δ k V 0 ( X k ) = V 0 ( x ) + δ 1 E x i = 2 σ C δ i V 0 ( X i 1 ) 1 + δ 1 E x δ σ C .
Combining (28) and (29), we have that for any x R , there exists δ ( 1 , ) such that
E x δ σ C δ τ V 0 ( x ) 1 < .
(2) ⟹ (3). For any d > 0 , consider the set D d defined by
D d : = { x R | E x δ τ C < d } .
We will firstly prove that D d is small, for any d > 0 . Note that
D d = ( D d C ) D d C c ,
and the union of two small sets remains small for irreducible and aperiodic kernel P η . So it suffices to prove that both D d C and D d C c are small. Since C is small and ( D d C ) C , it is evident that D d C is also small. Suppose x D d C c . By Markov’s inequality, for all k N * ,
P x ( σ C k + 1 ) = P x ( τ C k + 1 ) = P x ( δ τ C δ k + 1 ) δ ( k + 1 ) E x δ τ C d δ ( k + 1 ) .
Thus, for k that is sufficiently large,
inf x D d C c P x ( σ C k ) 1 2 > 0 .
Therefore, the set C is uniformly accessible from D d C c . Since P η is irreducible, according to Lemma A4 (1) in Appendix A, we have that D d C c is small.
Since
sup x R E x σ τ C sup x R E x σ σ C < ,
there exists b > 0 such that R D b , which is small from above. Therefore, the state space R is small.
(3) ⟹ (1). Suppose that the state space R is small set. We will firstly show that P η is irreducible, recurrent and positive. Since R is small, there exists m N and nonzero measure μ on ( R , B ( R ) ) such that for all x R and A B ( R ) ,
P η m ( x , A ) μ η ( A ) ,
which implies for all A B ( R ) such that μ η ( A ) > 0 , one has P η m ( x , A ) > 0 . Consequently, P η is irreducible. Since R is an accessible small set, σ R = 1 P x -a.s., for all x R . Applying Lemma A4 (2) in Appendix A, we have that P η is recurrent. According to Theorem 11.2.5 in [17], P η admits an invariant probability measure π η satisfying π η ( C ) < for every accessible set C; since R is accessible, this implies π η ( R ) < , showing that P η is positive.
Next, we will prove that P η is aperiodic by contradiction. Suppose that P η is an irreducible Markov kernel with period d > 1 . According to Lemma A3 in Appendix A, there exist C 0 , C 1 , ⋯, C d 1 of mutually disjoint accessible sets such that for i = 0 , , d 1 , and for any x C i , P η x , C i + 1 ( mod   d ) = 1 and hence
P η ( x , C ( i + 1 ) + 1 ( mod   d ) ) = 0 ,
where additions are in the modulo sense, and i = 0 d 1 C i is absorbing. Therefore, there exists i 0 { 0 , , d 1 } such that
P η m ( x , C i 0 ) μ η ( C i 0 ) > 0 ,
which contradicts with (30).
Finally, we can obtain (21) by applying Proposition 3 below, with C = R . □
Remark 2.
From the proof above, we can see that the uniform geometric ergodicity of P η 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 η ( 0 , 1 ) , suppose that P η admits an ( 1 , 2 ε ν ) -small set C with ν ( C ) = 1 . Assume that for some δ > 1 ,
sup x C E x k = 0 σ C δ k < .
Then there exists a constant β > 1 such that for all initiate distributions ξ on ( R , B ( R ) ) ,
n = 0 β n ξ P η n π η T V < .
The proof of the proposition above will be given in the next section.
Proof of Theorem 2.
The inequality (19) is an immediate consequence of Proposition 1 (3) and Proposition 2 (3). And the inequality (20) is obtained from (19) and the definition of TV distance (8). □

4. Splitting Construction and Split Markov Kernel P ˇ η

Let X ˇ : = R × { 0 , 1 } and ( X ˇ , X ˇ ) be a measurable space. In this section, based on the kernel P η , we will construct a new Markov kernel P ˇ η on the extended state space ( X ˇ , X ˇ ) . 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 P η admits an ( 1 , 2 ε ν ) -small set C with ε ( 0 , 1 ) and ν ( C ) = 1 . Let b ε be the Bernoulli distribution with success probability ε , given by
b ε : = ( 1 ε ) δ { 0 } + ε δ { 1 } .
For any bounded and measurable function f on ( X ˇ , X ˇ ) , define a function f ¯ ε on R by
f ¯ ε ( x ) : = [ δ x b ε ] f = ( 1 ε ) f ( x , 0 ) + ε f ( x , 1 ) .
From the definition of f ¯ ε above, we have for any measure ξ on ( R , B ( R ) ) ,
ξ ( f ¯ ε ) = [ ξ b ε ] ( f ) .
For η ( 0 , 1 ) , consider the residual kernel R η defined for x R and A B ( R ) by
R η ( x , A ) : = P η ( x , A ) ε ν ( A ) 1 ε , if x C ; P η ( x , A ) , if x C .
Now, for η ( 0 , 1 ) , define the split Markov kernel P ˇ η on ( X ˇ , X ˇ ) as follows. For ( x , d ) X ˇ and A ˇ X ˇ , set
P ˇ η ( x , d ; A ˇ ) : = Q η ( x , d ; · ) b ε ( A ˇ ) ,
where Q η is the Markov kernel on X ˇ × B ( R ) defined for all B B ( R ) by
Q η ( x , d ; B ) : = 1 C ( x ) 1 { 0 } ( d ) R η ( x , B ) + 1 { 1 } ( d ) ν ( B ) + 1 C c ( x ) P η ( x , B ) .
Equivalently, for all bounded and measurable function g on ( R , B ( R ) ) , one has
Q η g ( x , 0 ) = 1 C ( x ) R η g ( x ) + 1 C c ( x ) P η g ( x ) = R g ( y ) p η ( x , y ) d y ε ν ( g ) 1 ε , if x C R g ( y ) p η ( x , y ) d y , if x C ; Q η g ( x , 1 ) = 1 C ( x ) ν ( g ) + 1 C c ( x ) P η g ( x ) = ν ( g ) , if x C R g ( y ) p η ( x , y ) d y , if x C ,
where p η ( x , y ) = ( 2 π η σ 2 ) 1 / 2 exp ( y x η g ( x ) ) 2 2 η σ 2 is the kernel density of P η . It follows that for any bounded and measurable function f on ( X ˇ , X ˇ ) ,
P ˇ η f ( x , d ) = Q η f ¯ ε ( x , d ) .
Let us describe now the canonical chain associated with the kernel P ˇ η on X ˇ × X ˇ . For probability measure μ ˇ on X ˇ , denote by P ˇ μ ˇ the probability measure on the canonical space X ˇ N , X ˇ N such that the coordinate process, denoted by { ( θ k , D k ) } k 1 and called split chain, is a Markov chain with initial distribution μ ˇ and Markov kernel P ˇ η .
From the splitting construction above, ( D n ) n 0 is a sequence of i.i.d Bernoulli random variables with success probability ε that is independent of ( θ n ) n 1 . Denote by F k θ k 1 the natural filtration of the process ( θ k ) k 1 . An important property of the split chain { ( θ k , D k ) } k 1 is that if θ 0 and D 0 are independent, then { ( θ k , F k θ ) } k 1 is a Markov chain with kernel P η .
For a given η ( 0 , 1 ) , suppose that P η admits an ( 1 , ε ν ) -small set C. We have the following lemmas: Lemmas 2–4.
Lemma 2.
For any non-negative measure ξ on ( R , B ( R ) ) ,
[ ξ b ε ] P ˇ η n = ξ P η n b ε .
Lemma 3.
For any probability measures on ( R , B ( R ) ) , { ( θ k , F k θ ) } k 1 is under P ˇ ξ b ε a Markov chain on R × B ( R ) with initial distribution ξ and Markov kernel P η .
Lemma 4.
If λ ˇ η is a non-negative measure on ( X ˇ , X ˇ ) and is P ˇ η -invariant, then λ ˇ η = λ ˇ η , 0 b ε , where λ ˇ η , 0 is a non-negative measure on ( R , B ( R ) ) , defined by
λ ˇ η , 0 ( A ) : = λ ˇ η ( A × { 0 , 1 } ) , A B ( R ) .
In addition, λ ˇ η , 0 is P η -invariant.
For a given η ( 0 , 1 ) , suppose that P η admits an ( 1 , 2 ε ν ) -small set C with ν ( C ) = 1 . We can obtain the following properties: Lemmas 5 and 6.
Lemma 5.
Set α ˇ : = C × { 1 } and C ˇ : = C × { 0 , 1 } . Then the following results are true:
(1) 
The set α ˇ is an aperiodic atom for the kernel P η ˇ .
(2) 
The set C ˇ is small for the kernel P η ˇ .
(3) 
If C is accessible, then the atom α ˇ is accessible for P η ˇ , and hence P ˇ η is irreducible.
(4) 
For all k 1 , P ˇ η k α ˇ , α ˇ = ε ν P η k 1 ( C ) .
(5) 
If C is Harris recurrent for P η , then for any probability measure ξ on ( R , B ( R ) ) satisfying P ξ ( σ C < ) = 1 , P ˇ ξ δ d ( σ α ˇ < ) = 1 for all d { 0 , 1 } . Moreover, if P η is Harris recurrent, then P ˇ η is Harris recurrent.
(6) 
If C is accessible and P η admits an invariant probability measure π η , then α ˇ is positive for P ˇ η .
Lemma 6.
Assume that for some δ > 1 ,
sup x C E x k = 0 σ C δ k < .
Then:
(1) 
There exist constants γ ( 1 , δ ) and τ < τ 1 < such that
sup ( x , d ) C ˇ E ˇ ( x , d ) k = 0 σ α ˇ γ k τ sup x C E x k = 0 σ C 1 δ k ,
and for any non-negative measure ξ on ( R , B ( R ) ) ,
E ˇ ξ b ε k = 0 σ α ˇ γ k τ 1 E ξ k = 0 σ C 1 δ k ;
(2) 
P ˇ η admits a unique invariant probability measure π η b ε , where π η is the unique invariant probability measure of P η .
Proof. 
(1)
The condition (33) implies that
inf x C P x ( σ C < ) = 1 ,
so the set C is Harris recurrent (see also Proposition 4.2.5 (ii), [17]). By Lemma 5 (5), for all ( x , d ) C ˇ , P ˇ ( x , d ) ( σ C ˇ < ) = 1 and P ˇ ( x , d ) ( σ α ˇ < ) = 1 . So we have for all ( x , d ) C ˇ and γ ( 1 , δ ) ,
E ˇ ( x , d ) ( γ σ α ˇ ) = γ E ˇ ( x , d ) γ σ α ˇ 1 γ E ˇ ( x , d ) k = 0 σ α ˇ 1 γ k ,
which implies that for any ( x , d ) C ˇ and γ ( 1 , δ ) ,
E ˇ ( x , d ) k = 0 σ α ˇ γ k ( γ + 1 ) E ˇ ( x , d ) k = 0 σ α ˇ 1 γ k .
On the other hand, for any x C , we have by Lemma 3,
E ˇ δ x b ε k = 0 σ C ˇ 1 δ k = E x k = 0 σ C 1 δ k .
Note that for any positive random variable Y,
sup ( x , d ) C ˇ E ˇ ( x , d ) ( Y ) τ ε sup x C E ˇ δ x b ε ( Y ) ,
with τ ε : = ε 1 ( 1 ε ) 1 . Applying the above inequality to Y = k = 0 σ C ˇ 1 δ k , and combining (38) and the condition (33), we get
sup ( x , d ) C ˇ E ˇ ( x , d ) k = 0 σ C ˇ 1 δ k τ ε sup x C E ˇ δ x b ε k = 0 σ C ˇ 1 δ k = τ ε sup x C E x k = 0 σ C 1 δ k
< .
Similar to (36), we can obtain
E ˇ ( x , d ) ( δ σ C ˇ ) δ E ˇ ( x , d ) k = 0 σ C ˇ 1 δ k .
Combining (41) and (40), we obtain
sup ( x , d ) C ˇ E ˇ ( x , d ) δ σ C ˇ < .
By Lemma 5 (5), inf ( x , d ) C ˇ P ˇ ( x , d ) ( X 1 α ˇ ) > 0 . Applying Theorem 14.2.3 in [17] with A = C ˇ , B = α ˇ , h = 1 and q = 1 , and using (39), we get there exist γ ( 1 , δ ) , τ 0 < such that
sup ( x , d ) C ˇ E ˇ ( x , d ) k = 0 σ α ˇ 1 γ k τ 0 sup ( x , d ) C ˇ E ˇ ( x , d ) k = 0 σ C ˇ 1 δ k τ 0 τ ε sup x C E x k = 0 σ C 1 δ k .
Combining the last inequality with (37), the inequality (34) is thus obtained with τ : = ( γ + 1 ) τ 0 τ ε < .
Consider the shift operator T, defined by T ( ω 0 , ω 1 ) : = ( ω 1 , ω 2 ) , for any ω = ( ω 0 , ω 1 ) R N . Define inductively T 0 as the identity function, i.e., T 0 ( ω ) = ω , for ω R N ; and T n = T n 1 T , for n 1 . Notice that σ α ˇ σ C ˇ + σ α ˇ T σ C ˇ on the event { σ C ˇ < } and using Lemma 3, we get
E ˇ ξ b ε k = 0 σ α ˇ γ k E ˇ ξ b ε k = 0 σ C ˇ 1 γ k + E ˇ ξ b ε k = σ C ˇ σ α ˇ T σ C ˇ γ k E ˇ ξ b ε k = 0 σ C ˇ 1 γ k + E ˇ ξ b ε γ σ C ˇ sup ( x , d ) C ˇ E ˇ ( x , d ) k = 0 σ α ˇ γ k E ξ k = 0 σ C 1 γ k 1 + γ sup ( x , d ) C ˇ E ˇ ( x , d ) k = 0 σ α ˇ γ k .
Therefore, by (34) and (33), there exists τ 1 ( τ , ) such that the inequality (35) is satisfied.
(2)
Let η ( 0 , 1 ) be fixed. From Proposition 1 (2), P η 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 sup x C E x ( σ C ) < . From Lemma A4 (3) in Appendix A, we have P η is positive. Thus by Lemma 5, α ˇ is accessible, aperiodic, and positive atom for the split kernel P ˇ η . Using the inequality (34), the condition (33) implies that there exists γ ( 1 , δ ) such that
E ˇ α ˇ k = 0 σ α ˇ γ k < .
Applying Theorem 11.4.2 in [17] to P ˇ η , we get it has a unique invariant probability measure π ˇ η , which is expressed as π η b ε by Lemma 4, where π η is the unique invariant probability measure for P η .
  • Using the lemmas above, we can prove Proposition 3 as follows.
Proof of Proposition 3.
Lemma 2 implies for n 1 ,
ξ P η n π η T V ( ξ b ε ) P ˇ η n π η b ε T V .
So we have
n = 1 β n ξ P η n π η T V n = 1 β n ( ξ b ε ) P ˇ η n π η b ε T V .
In Lemma 6, it is proven that α ˇ is an accessible, aperiodic, and positive atom for P ˇ η , which admits unique invariant probability measure π η b ε ; moreover, it is proven that (42) is true. Now, applying Lemma A5 in Appendix B to P ˇ η with α = α ˇ , we obtain that there exist β ( 1 , γ ) and τ < such that
n = 1 β n ( ξ b ε ) P ˇ η n π η b ε T V τ E ˇ ξ b ε n = 1 σ α ˇ γ n .
Combining this inequality with (35) and (43) in Lemma 6 and the condition (33), we can obtain the desired inequality (32). □

5. Conclusions

This work investigates the convergence rate of EM scheme ( θ k ) k 0 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), ( θ k ) k 0 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, ( θ k ) k 0 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 f = 1 X . Their results hold under the following “Minorization Condition” of the chain: for some δ > 0 , some C B ( X ) and some probability measure ν with ν ( C c ) = 0 and ν ( C ) = 1 ,
P ( x , A ) δ 1 C ( x ) ν ( A ) , A B ( X ) , x X .
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 ( 1 , ε ν ) -small set D, with ε ( 0 , 1 ) and ν ( D ) = 1 , 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 P η 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 P η .
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 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 h ( α ) instead of h ( x ) for all x α . With this convention, for every positive X N -measurable random variable Y such that E x ( Y ) is constant on α , we write E α ( Y ) instead of E x ( Y ) , for any x α .
The following result shows the convergence rate of P n 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 γ > 1 such that
E α n = 1 σ α γ n < .
Then there exist β ( 1 , γ ) and a constant τ < such that for every probability measure ξ on ( X , X ) ,
n = 1 β n ξ P n π T V τ E ξ n = 1 σ α γ n .
The lemma above can be obtained by applying Theorem 13.4.3 in [17] with f = 1 X therein.

Appendix C. Some Auxiliary Result

Recall that
b η : = 2 g 2 ( 0 ) L 2 η 2 + 1 2 K 1 + σ 2 + 2 c η , η ( 0 , 1 ) .
In this part, we will conduct an analysis on the functions λ ( η ) and f 1 ( η ) defined respectively as follows. For any η ( 0 , 1 ) , λ ( η ) : = 1 K 1 2 η + 2 L 2 η 2 and
f 1 ( η ) : = 2 b η K 1 η 2 .
We have the following result.
Lemma A6.
(1) 
There exists a constant η 0 ( 0 , 1 ) depending only on K 1 and L such that for all η ( 0 , η 0 ] , the function η λ ( η ) is decreasing and 0 < λ ( η ) < 1 .
(2) 
The function η f 1 ( η ) is decreasing on ( 0 , 1 ) .
Proof. 
(1)
The function λ ( η ) is quadratic polynomial and can be written as
λ ( η ) = 2 L 2 η K 1 8 L 2 2 + 1 K 1 2 32 L 2 .
Taking into account that λ ( 0 ) = 1 and λ ( η ) is symmetric w.r.t η = K 1 / 8 L 2 > 0 , we can immediately obtain the result.
(2)
By (A2) and (A3), we have for η ( 0 , 1 ) ,
f 1 ( η ) = 4 g 2 ( 0 ) L 2 K 1 + K 1 + 2 σ 2 + 4 c K 1 η
and
f 1 ( η ) = K 1 + 2 σ 2 + 4 c K 1 η 2 < 0 .
Consequently, the function f 1 ( η ) is decreasing on ( 0 , 1 ) .

References

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. Protter, P.; Talay, D. The Euler scheme for Lévy driven stochastic differential equations. Ann. Probab. 1997, 25, 393–423. [Google Scholar] [CrossRef] [Scilit]
  9. 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]
  10. Ding, Z.; Li, Q. Langevin Monte Carlo: Random coordinate descent and variance reduction. J. Mach. Learn. Res. 2021, 22, 1–51. [Google Scholar]
  11. 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]
  12. Roberts, G.O.; Tweedie, R.L. Exponential convergence of Langevin distributions and their discrete approximations. Bernoulli 1996, 2, 341–363. [Google Scholar] [CrossRef] [Scilit]
  13. 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]
  14. Durmus, A.; Moulines, É. Nonasymptotic convergence analysis for the unadjusted Langevin alorithm. Ann. Appl. Probab. 2017, 27, 1551–1587. [Google Scholar]
  15. 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]
  16. 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]
  17. Douc, R.; Moulines, E.; Priouret, P.; Soulier, P. Markov Chains, 1st ed.; Springer: Berlin/Heidelberg, Germany, 2018. [Google Scholar]
  18. Meyn, S.P.; Tweedie, R.L. Markov Chains and Stochastic Stability, 2nd ed.; Cambridge University Press: Cambridge, UK, 2009. [Google Scholar]
  19. Dedecker, J.; Gouëzel, S. Subgaussian concentration inequalities for geometrically ergodic Markov chains. Electron. Commun. Probab. 2015, 20, 1–12. [Google Scholar] [CrossRef] [Scilit]
  20. Nummelin, E. General Irreducible Markov Chains and Non-Negative Operators; Cambridge University Press: Cambridge, UK, 1984. [Google Scholar]
  21. 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.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.