Computation of the invariant measure for a L\'evy driven SDE: Rate of convergence
Abstract
We study the rate of convergence of some recursive procedures based on some "exact" or "approximate" Euler schemes which converge to the invariant measure of an ergodic SDE driven by a L\'evy process. The main interest of this work is to compare the rates induced by exact and approximate Euler schemes. In our main result, we show that replacing the small jumps by a Brownian component in the approximate case preserves the rate induced by the exact Euler scheme for a large class of L\'evy processes.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.