Discretization error for a two-sided reflected L\'evy process
Abstract
An obvious way to simulate a L\'evy process is to sample its increments over time , thus constructing an approximating random walk . 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 and regulators at the lower and upper barriers at some fixed time. Under the weak assumption that has a non-trivial weak limit for some scaling function as , it is proved in particular that converges weakly to , where the sign depends on the last barrier visited. Here the limit 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 is provided both theoretically and numerically.
Cite
@article{arxiv.1708.03948,
title = {Discretization error for a two-sided reflected L\'evy process},
author = {Søren Asmussen and Jevgenijs Ivanovs},
journal= {arXiv preprint arXiv:1708.03948},
year = {2018}
}