Paper: arXiv 2505.00255
Authors: Takuji Arai
Abstract
We develop a numerical method for locally risk-minimizing (LRM) strategies for Barndorff-Nielsen and Shephard (BNS) models. Arai et al. (2017) derived a mathematical expression for LRM strategies in BNS models using Malliavin calculus for Lévy processes and presented some numerical results only for the case where the asset price process is a martingale. Subsequently, Arai and Imai (2024) developed the first Monte Carlo (MC) method available for non-martingale BNS models with infinite active jumps. Here, we modify the expression obtained by Arai et al. (2017) into a numerically tractable form, and, using the MC method developed by Arai and Imai (2024), propose a numerical method of LRM strategies available for non-martingale BNS models with infinite active jumps. In the final part of this paper, we will conduct some numerical experiments.
Complexity vs Empirical Score
- Math Complexity: 9.0/10
- Empirical Rigor: 3.0/10
- Quadrant: Lab Rats — high math complexity, limited empirical testing
Why this score: The paper is extremely dense in advanced mathematics, utilizing Malliavin calculus for Lévy processes and complex stochastic calculus derivations for a non-martingale model. While it mentions numerical experiments, the focus is heavily on modifying theoretical expressions into a tractable form using Monte Carlo methods, with no presented code, specific datasets, or empirical performance metrics in the provided excerpt.
Research Flowchart
flowchart TD
A["Research Goal: Develop Numerical Method<br>for LRM Strategies in BNS Models"] --> B["Key Methodology Step: Modify Arai et al.<br>Expression via Malliavin Calculus"]
B --> C{"Model Type?"}
C -- Martingale --> D["Direct Computation<br>from Arai et al. (2017)"]
C -- Non-Martingale w/ Infinite Jumps --> E["Monte Carlo Method<br>Arai & Imai (2024)"]
D & E --> F["Computational Process:<br>Simulate Lévy Processes &<br>Estimate LRM Strategies"]
F --> G["Key Outcomes:<br>Numerical Experiments &<br>Analysis of Strategies"]
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes a numerical method for locally risk‑minimizing (LRM) strategies in non‑martingale IG‑OU type Barndorff‑Nielsen and Shephard (BNS) models, using the Monte Carlo method of Arai and Imai (2024).
Source sentence
Here, we modify the expression obtained by Arai et al. (2017) into a numerically tractable form, and, using the MC method developed by Arai and Imai (2024), propose a numerical method of LRM strategies available for non-martingale BNS models with infinite active jumps.
Assumes 3
- The risk‑free interest rate is assumed to be zero. market
Source sentence
For simplicity, the interest rate of our market is assumed to be zero.
- Assumption 2.1 imposes conditions on model parameters (e.g., b^2/2 > 2(1‑e^{‑λT})/λ ∨ |ρ| and α e^{‑λT}σ^2_0 + C_ρ^2 > -1) to ensure positivity of the SDE solution and existence of the minimal martingale measure. model
Source sentence
To begin with, we introduce the following as-sumption: Assumption 2.1. Throughout this paper, we assume that b2 2 > 2 1 −e−λT λ ∨|ρ| and α e−λT σ2 0 + Cρ 2 > −1, where Cρ 2 := Z ∞ 0 (eρx −1)2fν(x)dx = 2ρλa 1 p b2 −4ρ − 1 p b2 −2ρ ! .
- The analysis is restricted to IG‑OU type BNS models, which have infinite active jumps. model
Source sentence
Throughout this paper, we consider IG-OU type BNS models.
Data
- NV and Scho parameter sets synthetic unknown
Source sentence
We use two model parameter sets shown in Table 4.1. NV and Scho, respectively, are the parameter sets introduced in Table 5.1 of [6] and a modified version of the set introduced in Table 7.1 of [8].
Costs
Not applicable
Finds 3
- Numerical experiments show that the computed LRM strategy values are close to 1 for deep‑in‑the‑money options, close to 0 for out‑of‑the‑money options, and decrease rapidly around at‑the‑money, matching patterns reported in earlier work. performance
Source sentence
In particular, the values of LRM strategies are close to 1 for deep ITM options, 0 for OTM options, and rapidly decreasing around ATM. Although no way to evaluate the accuracy, these facts indicate that our algorithm is working.
- If the approximation error for C_ρ^1 is not sufficiently small (e.g., poor choice of N and {z_n}), the LRM values for OTM options deviate markedly from zero, indicating sensitivity to numerical parameters. theoretical
Source sentence
It is worth noting that choosing N and {zn}n=1,...,N for which the approximation error to Cρ 1 is not small enough results in poor accuracy, with LRM for OTM options being far from 0.
- The proposed algorithm is time‑consuming, requiring a trade‑off between the number of simulation points N and computational speed. other
Source sentence
Finally, the proposed algorithm is time-consuming.
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 13 related papers). Coverage is partial, so this is neither replication nor refutation.
Code
No repository by the authors found in the paper.
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.