Euler–Maruyama method

In Itô calculus, the Euler–Maruyama method (also simply called the Euler method) is a method for the approximate numerical solution of a stochastic differential equation (SDE). It is an extension of the Euler method for ordinary differential equations to stochastic differential equations named after Leonhard Euler and Gisiro Maruyama. The same generalization cannot be done for any arbitrary deterministic method.[1]

Definition

edit

Consider the stochastic differential equation (see Itô calculus)

 

with initial condition X0 = x0, where Wt denotes the Wiener process, and suppose that we wish to solve this SDE on some interval of time [0, T]. Then the Euler–Maruyama approximation to the true solution X is the Markov chain Y defined as follows:

  • Partition the interval [0, T] into N equal subintervals of width  :
 
  • Set Y0 = x0
  • Recursively define Yn for 0 ≤ n ≤ N-1 by
 
where
 

The random variables ΔWn are independent and identically distributed normal random variables with expected value zero and variance Δt.

Derivation

edit

The Euler-Maruyama formula can be derived by considering the integral form of the Itô SDE

 

and approximating   and   on the small time interval  .

Strong and weak convergence

edit

Like other approximation methods, the accuracy of the Euler–Maruyama scheme is analyzed through comparison to an underlying continuous solution. Let   denote an Itô process over  , equal to

 

at time  , where   and   denote deterministic "drift" and "diffusion" functions, respectively, and   is the Wiener process. As discrete approximations of continuous processes are typically assessed through comparison between their respective final states at  , a natural convergence criterion for such discrete processes is

 

Here,   corresponds to the final state of the discrete process  , which approximates   by taking   steps of length  . [2] Iterative schemes satisfying the above condition are said to strongly converge to the continuous process  , which automatically implies their satisfaction of the weak convergence criterion,

 

for any smooth function  . [3] More specifically, if there exists a constant   and   such that

 

for any  , the approximation converges strongly with order   to the continuous process  ; likewise,   converges weakly to   with order   if the same inequality holds with   in place of  . Strong order   convergence implies weak order   convergence: exemplifying this, it was shown in 1972 [4] that the Euler–Maruyama method strongly converges with order   to any Itô process, provided   satisfy Lipschitz continuity and linear growth conditions with respect to  , and in 1974, the Euler–Maruyama scheme was proven to converge weakly with order   to Itô processes governed by the same such  , [5] provided that their derivatives also satisfy similar conditions. [6]

Example with geometric Brownian motion

edit
 
Simulation of geometric Brownian motion. Solid lines show an analytic solution, dashed lines show the Euler-Maruyama method.
 
Strong error convergence plot for Euler-Maruyama.
 
Weak error convergence plot for Euler-Maruyama.

A simple case to analyze is geometric Brownian motion, which satisfies the SDE

 

for fixed   and  . Applying Itô’s lemma to   yields the closed-form solution

 

Discretising with Euler–Maruyama gives the time-step updates

 

By using a Taylor series expansion of the exponential function in the analytic solution, we can get a formula for the exact update in a time-step.

 

Summing the local errors between the analytic and Euler-Maruyama solutions over each of the   steps gives the strong error estimate

 

confirming strong order   convergence.

Another numerical aspect to consider is stability. The path's second moment is  , so long-time decay of the solution occurs only when  . The Euler–Maruyama scheme preserves variance decay in this case provided that  .

Application

edit
 
Gene expression modelled as a stochastic process.

An area that has benefited significantly from SDEs is mathematical biology. As many biological processes are both stochastic and continuous in nature, numerical methods of solving SDEs are highly valuable in the field.

References

edit
  1. ^ Kloeden, P.E. & Platen, E. (1992). Numerical Solution of Stochastic Differential Equations. Springer, Berlin. ISBN 3-540-54062-8.
  2. ^ Higham, Desmond J. (2001). "An Algorithmic Introduction to Numerical Simulation of Stochastic Differential Equations". SIAM Review. 43 (3). Philadelphia, PA: Society for Industrial and Applied Mathematics: 525–546. ISSN 0036-1445.
  3. ^ Kloeden, P.E. & Platen, E. (1992). Numerical Solution of Stochastic Differential Equations. Springer, Berlin. ISBN 3-540-54062-8.
  4. ^ Gikhman, Iosif I.; Skorokhod, Anatoli V.; Kotz, S. (2007). The Theory of Stochastic Processes III. Classics in Mathematics (1 ed.). Berlin, Heidelberg: Springer Berlin / Heidelberg. ISBN 9783540499404.
  5. ^ Mil’shtein, G. N. (1979). "A Method of Second-Order Accuracy Integration of Stochastic Differential Equations". Theory of Probability and Its Applications. 23 (2). Philadelphia: Society for Industrial and Applied Mathematics: 396–401. ISSN 0040-585X.
  6. ^ Mil’shtejn, G. N. (1975). "Approximate Integration of Stochastic Differential Equations". Theory of Probability and Its Applications. 19 (3). Philadelphia: Society for Industrial and Applied Mathematics: 557–562. ISSN 0040-585X.