2000 character limit reached
On the Simulation of General Tempered Stable Ornstein-Uhlenbeck Processes
Published 15 Apr 2019 in math.PR | (1904.06791v2)
Abstract: We give an explicit representation for the transition law of a tempered stable Ornstein-Uhlenbeck process and use it to develop a rejection sampling algorithm for exact simulation of increments from this process. Our results apply to general classes of both univariate and multivariate tempered stable distributions and contain a number of previously studied results as special cases.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.