ajdmom.ito_cond2_mom¶
Itô process conditional moments under Square-Root Jump Diffusion (SRJD), with condition on the initial state and the realized jumps over the interval.
Note that:
The unconditional moment derivation is supported within
ajdmom.mdl_srjd.momandajdmom.mdl_srjd.cmom.The conditional moment derivation with \(v_0\) given is supported within
ajdmom.mdl_srjd.cond_momandajdmom.mdl_srjd.cond_cmom.
Highlights¶
This module
offers supports for deriving conditional moments for models including jumps in the variance ( SRJD, SVVJ, SVIJ and SVCJ), by
assuming that the initial state of the SRJD, and the realized jump times and jump sizes in the SRJD over the concerned interval are given beforehand.
Square-Root Jump Diffusion¶
The Square-Root Jump Diffusion (SRJD) is described by the following SDE,
which adds a jump component \(z(t)\) (a CPP) into the CIR diffusion. We introduce the following notations for simplification,
The solution to the SDE can then be expressed as
noting that \(v_0 \equiv v(0)\) and \(I\!E_t \equiv \int_0^t e^{ks}\sqrt{v(s)} dw^v(s)\). Further,
In order to derive conditional moment formulae for models including jumps in the variance, SVVJ, SVIJ and SVCJ, we first compute the conditional moments
noting that \(I_t \equiv \int_0^t \sqrt{v(s)} dw^v(s)\), \(I_t^{*} \equiv \int_0^t \sqrt{v(s)} dw(s)\) and the Brownian motion in the price process is decomposed as \(w^s(t) = \rho w^v(t) + \sqrt{1-\rho^2}w(t)\), refer to the Theory page for the definitions of these quantities.
Recursive Equations¶
Itô process moment¶
in which, for notation simplification, the condition notation \(|v_0, z(s), 0\le s\le t\) is also removed from all conditional expectations on the right-hand side of above equation.
We decode
\(\mathbb{E}[I\!E_t^{n_1} I_t^{n_2} (I_t^{*})^{n_3}|v_0, z(s), 0\le s\le t]\)
as the following Poly,
where \(c_{\boldsymbol{j}\boldsymbol{l}\boldsymbol{o}}\) denotes the corresponding coefficient, vector \(\boldsymbol{j} \equiv (j_1,\dots,j_6)\),
\(n\) denotes the number of CPPs being multiplied together, and function \(f_{Z_t}(\boldsymbol{l}, \boldsymbol{o})\) is defined as
Please note that \(s_{i_1}\vee \cdots \vee s_{i_p} \equiv \max\{s_{i_1},\dots,s_{i_p} \}\).
Formulae for \(n_1+n_2=2\) combinations,
Integrals¶
The essential computation now becomes
We first present the result and implementation as the following:
where the function on the right-hand side is defined as
if \(n \ge 1\), otherwise, \(F_{Z_t}(\boldsymbol{l},\boldsymbol{o}, i, j)\equiv\int_{0}^t e^{iks} s^j ds\).
The integral in (3) is implemented in
int_et_fZ() in module
ito_cond2_mom. The integral
\(\int_{s_{i_1}\vee \cdots \vee s_{i_n}}^t e^{iks} s^j ds\) is
calculated as we did for \(\int_0^t e^{iks} s^j ds\) in
ajdmom.ito_mom.
Then, we explain the calculations. Let’s take a look at a simple example, \(\int_0^te^{ks}I\!E\!Z_s ds\).
In short,
Another example
Hopefully, the two examples should have explained the derivation well.
Implementation summary¶
Define
recursive_IEII()to realize the recursive step in equation (1).Define
moment_IEII()to finish the computation of \(\mathbb{E}[I\!E_t^{n_1}I_t^{n_2}(I_t^{*})^{n_3}|v_0, z_s, 0\le s\le t]\).
Functions
|
integral of \(coef \times \int_0^t e^{mks} I\!E\!Z_s poly ds\) |
|
integral of \(coef \times tp \times \int_0^t e^{mks} poly ds\) |
|
integral of \(\int_0^t e^{iks} s^j f_{Z_s}(l,o)ds\) |
|
\(\mathbb{E}[I\!E_t^{n_1}I_t^{n_2}(I_t^{*})^{n_3} |v_0, z(s), 0\le s\le t]\) |
|
Convert a polynomial to numerical value |
|
Recursive step in equation (1) |