Abstract
We develop a distributional decomposition approach for exactly simulating two types of Gamma-driven Ornstein–Uhlenbeck (OU) processes with time-varying marginal distributions: the Gamma-OU process and the OU-Gamma process. The former has finite-activity jumps, and its marginal distribution is asymptotically Gamma; the latter has infinite-activity jumps that are driven by a Gamma process. We prove that the transition distributions of the two processes at any given time can be exactly decomposed into simple elements: at any given time, the former is equal in distribution to the sum of one deterministic trend and one compound Poisson random variable (r.v.); the latter is equal in distribution to the sum of one deterministic trend, one compound Poisson r.v., and one Gamma r.v. The results immediately lead to very efficient algorithms for their exact simulations without numerical inversion. Extensive numerical experiments are reported to demonstrate the accuracy and efficiency of our algorithms.
Acknowledgement
The authors would like to thank the reviewer for very helpful and constructive comments and suggestions.
Disclosure statement
No potential conflict of interest was reported by the authors.
Notes
1 It is fundamentally built upon a Gamma distribution. As an important alternative to the normal distribution, the Gamma distribution is widely used as the building block for a variety of useful stochastic processes, such as the Gamma process and variance Gamma process, see Madan and Seneta (Citation1990) and Madan, Carr, and Chang (Citation1998).
2 The abbreviation “Γ-OU” is borrowed from Barndorff-Nielsen and Shephard (Citation2003a).
3 When working with non-negative random variables, it is common for a lot of researchers to use Laplace transforms rather than characteristic functions, see Bertoin (Citation1998, Chapter III), Bertoin (Citation1999), Sato (Citation1999, Chapter 6), and Norberg (Citation2004). In fact, all of our calculations can be repeated using characteristic functions instead, and we avoid potential complications with complex arguments.
4 For details of the martingale approach, see Dassios and Embrechts (Citation1989), Dassios and Jang (Citation2003), and Dassios and Zhao (Citation2011).
5 Our algorithms are also applicable to any irregularly spaced intervals.