Papers › How to verify that a given process is a Lévy-Driven Ornstein-Uhlenbeck Process

How to verify that a given process is a Lévy-Driven Ornstein-Uhlenbeck Process

6 Jan 2025arXiv:2501.03434links table onlyarchive 2025-07-28

Ibrahim Abdelrazeq, Hardy Smith, Dinmukhammed Zhanbyrshy

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Assuming that a L\'evy-Driven Ornstein-Uhlenbeck (or CAR(1)) processes is observed at discrete times $0$, h, 2h,⋯ [T/h]h. We introduce a step-by-step methodological approach on how a person would verify the model assumptions. The methodology involves estimating the model parameters and approximating the driving process. We demonstrate how to use the increments of the approximated driving process, along with the estimated parameters, to test the assumptions that the CAR(1) process is L\'evy-driven. We then show how to test the hypothesis that the CAR(1) process belongs to a specified class of L\'evy processes. The performance of the tests is illustrated through multiple simulations. Finally, we demonstrate how to apply the methodology step-by-step to a variety of economic and financial data examples.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections