Paper: arXiv 2503.02965

Authors: Eduardo Abi Jaber, Maxime Guellil

Abstract

Fourier-based methods are central to option pricing and hedging when the Fourier-Laplace transform of the log-price and integrated variance is available semi-explicitly. This is the case for the Volterra Stein-Stein stochastic volatility model, where the characteristic function is known analytically. However, naive evaluation of this formula can produce discontinuities due to the complex square root of a Fredholm determinant, particularly when the determinant crosses the negative real axis, leading to severe numerical instabilities. We analyze this phenomenon by characterizing the determinant’s crossing behavior for the joint Fourier-Laplace transform of integrated variance and log-price. We then derive an expression for the transform to account for such crossings and develop efficient algorithms to detect and handle them. Applied to Fourier-based pricing in the rough Stein-Stein model, our approach significantly improves accuracy while drastically reducing computational cost relative to existing methods.

Complexity vs Empirical Score

  • Math Complexity: 8.5/10
  • Empirical Rigor: 4.0/10
  • Quadrant: Lab Rats — high math complexity, limited empirical testing

Why this score: The paper delves deeply into operator theory, Fredholm determinants, and analytic continuation in complex analysis, making the math dense and advanced. While it discusses numerical algorithms and cites computational improvements, it focuses on theoretical derivation and methodological correction rather than providing backtests, datasets, or implementation-heavy empirical validation.

Research Flowchart

  flowchart TD
  A["Research Goal<br>Analyze discontinuities in complex square root<br>of Fredholm determinants in Volterra Stein-Stein model"] --> B["Input Data<br>Fourier-Laplace transform of log-price<br>and integrated variance (analytical)"]

  B --> C["Key Methodology<br>Characterize determinant crossing behavior<br>on negative real axis"]

  C --> D["Computational Process<br>Develop detection algorithms for crossings<br>Derive corrected transform expression"]

  D --> E["Application<br>Implement efficient Fourier-based pricing<br>in rough Stein-Stein model"]

  E --> F["Key Outcomes<br>1. Resolved numerical instabilities<br>2. Improved accuracy vs. existing methods<br>3. Drastically reduced computational cost"]

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 derives a complex‑plane formula for the Fourier–Laplace transform that accounts for Fredholm determinant crossings and introduces efficient algorithms to detect and handle these crossings, improving pricing accuracy and computational speed.

Source sentence
derive an expression for the transform to account for such crossings and develop efficient algorithms to detect and handle them

Assumes 3

  • The Volterra kernel K is of continuous and bounded type in L2(R). model
    Source sentence
    For K being a Volterra kernel of continuous and bounded type in L2 R, we introduce the following notation for det(Φ)
  • The determinant crossing count k is an integer counting the number of times the Fredholm determinant crosses the negative real axis. model
    Source sentence
    This formula introduces a prefactor eiπk, where k corresponds to the number of time the determinant has crossed the negative real axis.
  • The discretization step n can be chosen coarse for a low‑precision proxy without affecting the sign of the transform. statistical
    Source sentence
    we can reasonably expect that even a coarse approximation will share the same sign as the true value

Data

Synthetic data only.

Costs

Not applicable The paper reports no trading or execution result.

Finds 3

  • The proposed determinant‑based formula combined with the hybrid or Lipschitz algorithms yields superior accuracy and substantially lower computational time compared to the traditional trace formula. performance
    Source sentence
    we demonstrate the superior accuracy and computational efficiency of the determinant formula (1.13), combined with either the Hybrid Algorithm 1, the Lipschitz Algorithm 2, or the prefactor‑free formula (3.8), relative to the trace formula (1.6)
  • A low‑precision proxy based on a coarse discretization can correctly adjust the sign of the Fourier–Laplace transform with negligible extra cost. theoretical
    Source sentence
    the sign obtained from the determinant formula (3.1) along the grid is compared to the sign of this proxy, and is adjusted if the two signs differ, thereby recovering the correct value of the Fourier–Laplace transform
  • When the extra cost of computing a matrix square root is negligible, the prefactor‑free formula becomes computationally more efficient; otherwise it is less advantageous. performance
    Source sentence
    the additional cost of computing a matrix square root becomes negligible, making the prefactor‑free formula computationally more efficient

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 18 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.

Cited References (47)

  1. Not-so-complex logarithms in the H eston model (2005)
  2. Stochastic volatility with an O rnstein– U hlenbeck process: an extension (1999)
  3. The little H eston trap (2007)
  4. Why the rotation count algorithm works (2006)
  5. Stock price distributions with stochastic volatility: an analytic approach (1991)
  6. Why the Rotation Count Algorithm works (2006) — link
  7. Complex Logarithms in H eston-Like Models (2008) — link
  8. Transform Analysis and Asset Pricing for Affine Jump-diffusions (2000) — link
and 39 more
  1. A Closed-Form Solution for Options with Stochastic Volatility with Applications to Bond and Currency Options (1993) — link
  2. Reforming the W ishart characteristic function (2019) — link
  3. Gaussian stochastic volatility models: Scaling regimes, large deviations, and moment explosions (2020)
  4. Kernels of trace class operators (1988)
  5. The characteristic function of G aussian stochastic volatility models: an analytic expression (2022)
  6. Sur une classe d’équations fonctionnelles (1903) — link
  7. Estimating Option Prices with H eston’s Stochastic Volatility Model (2014) — link
  8. Moment Explosions in Stochastic Volatility Models (2007) — link
  9. Notes on infinite determinants of H ilbert space operators (1977) — link
  10. The L aplace transform of the integrated V olterra W ishart process (2022)
  11. Introduction to the Theory of Linear Nonselfadjoint Operators (1969)
  12. A closed-form solution for options with stochastic volatility with applications to bond and currency options (1993)
  13. Exact asymptotics in eigenproblems for fractional Brownian covariance operators (2018)
  14. The stochastic F ubini theorem revisited (2012)
  15. Option Valuation Using the Fast F ourier Transform (2001) — link
  16. A short rate model using ambit processes (2013)
  17. The V olterra S tein- S tein model with stochastic interest rates — → 2503.01716
  18. A Simple Option Formula for General Jump-Diffusion and Other Exponential L evy Processes (2002) — link
  19. On the sample complexity of L ipschitz constant estimation (2023)
  20. Under lineare methoden in der wahr scheinlichkeitsrechnung (1947)
  21. Probability Theory II (1978) — link
  22. Traces and determinants of linear operators (2012)
  23. Notes on infinite determinants of H ilbert space operators (1977)
  24. Trace ideals and their applications (2005)
  25. Integral equations (1958)
  26. On the numerical evaluation of F redholm determinants (2010)
  27. The volatility surface: A Practitioner’s Guide (2011)
  28. A course in functional analysis (2019)
  29. Jupyter Notebooks–a publishing format for reproducible computational workflows (2016)
  30. Building machine learning and deep learning models on Google cloud platform (2019)
  31. Operator lipschitz functions (2016)
  32. The Schur complement and its applications (2006)
  33. Jump-diffusion processes: Volatility smile fitting and numerical methods for option pricing (2000)
  34. Option valuation using the fast F ourier transform (1999)
  35. Analysis of F ourier transform valuation formulas and applications (2010)
  36. A novel pricing method for European options based on F ourier-cosine series expansions (2009)
  37. Mathematical methods for foreign exchange: A financial engineer’s approach (2001)
  38. Wiener chaos and the Cox–Ingersoll–Ross model (2005)
  39. COMPUTATION OF FREDHOLM DETERMINANTS FOR QUADRATIC ORNSTEIN-UHLENBECK FUNCTIONALS (2015)

1 of 47 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.