Discretization error for a two-sided reflected L\'evy process

Abstract

An obvious way to simulate a L\'evy process X is to sample its increments over time 1/n, thus constructing an approximating random walk X(n). This paper considers the error of such approximation after the two-sided reflection map is applied, with focus on the value of the resultant process Y and regulators L,U at the lower and upper barriers at some fixed time. Under the weak assumption that X/a has a non-trivial weak limit for some scaling function a as 0, it is proved in particular that (Y1-Y(n)n)/a1/n converges weakly to V, where the sign depends on the last barrier visited. Here the limit V is the same as in the problem concerning approximation of the supremum as recently described by Ivanovs (2017). Some further insight in the distribution of V is provided both theoretically and numerically.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…