MFNANAPRMay 24

Fast simulation of Volterra processes using random Fourier features with application to the log-stationary fractional Brownian motion

arXiv:2603.0294621.4h-index: 1
Predicted impact top 72% in MF · last 90 daysOriginality Incremental advance
AI Analysis

This work provides a faster and more general simulation method for Volterra processes, benefiting researchers in stochastic processes and applied fields like finance and physics.

The paper develops a fast simulation framework for stochastic Volterra processes using Random Fourier Features (RFF) to approximate the kernel, achieving computational efficiency and strong error bounds. For the log-stationary fractional Brownian motion, they derive a closed-form spectral density, provide error bounds, and demonstrate accuracy and competitiveness in numerical experiments.

A fast simulation framework for stochastic Volterra processes based on Random Fourier Features (RFF) approximation of the kernel is developed. After recalling the main properties of Volterra processes and reviewing existing numerical simulation methods, an accelerated scheme is introduced that relies on a spectral representation of the kernel. A particular attention is devoted to sampling from the kernel spectral density using Hamiltonian Monte Carlo, whose efficiency and stability bring more convenience than alternative sampling procedures. Quantitative guarantees for the proposed method are established, including moment estimates and strong error bounds. The approach is further compared with the kernel approximation by sum of exponentials commonly used in the literature, emphasizing the broader generality of the present framework. As a primary application, Volterra processes associated with the Stationary fractional Brownian Motion (S-fBM) kernel are investigated. A spectral density representation is derived in closed form using hypergeometric functions, a condition for positive definiteness is established and explicit truncation as well as Monte Carlo error bounds are provided for the RFF approximation in this setting. Numerical experiments in dimensions one and two illustrate the accuracy of the kernel approximation, the reliable recovery of model parameters and the competitiveness of the accelerated simulation scheme in terms of computational efficiency and both weak and strong error performance.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes