Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 78 tok/s
Gemini 2.5 Pro 50 tok/s Pro
GPT-5 Medium 15 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 169 tok/s Pro
GPT OSS 120B 469 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

CIR equations with multivariate Lévy noise (2204.07245v2)

Published 14 Apr 2022 in math.PR

Abstract: The paper is devoted to the study of the short rate equation of the form $$ d R(t)=F(R(t)) dt+\sum_{i=1}{d}G_i(R(t-)) dZ_i(t), \quad R(0)=x\geq 0,\quad t>0, $$ with deterministic functions $F,G_1,...,G_d$ and a multivariate L\'evy process $Z=(Z_1,...,Z_d)$. The equation is supposed to have a nonnegative solution which generates an affine term structure model. Two classes of noise are considered. In the first one the coordinates of Z are independent processes with regularly varying Laplace exponents. In the second class Z is a spherical processes, which means that its L\'evy measure has a similar structure as that of a stable process, but with radial part of a general form. For both classes a precise form of the short rate generator is characterized. Under mild assumptions it is shown that any equation of the considered type has the same solution as the equation driven by a L\'evy process with independent stable coordinates. The paper generalizes the classical results on the Cox-Ingersoll-Ross (CIR) model as well as on its extended version where $Z$ is a one-dimensional L\'evy process.

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.