SearcharxivSearch

arXiv · 2606.31220

Efficient Computation Of Sensitivities For Derivatives In Energy Markets

Abstract

In this study, we develop a stochastic framework for computing Delta sensitivities in energy markets, where both prices and traded volumes are modeled as correlated stochastic processes. Within this framework, we analyze two complementary approaches for sensitivity analysis: the density method, which is applicable when the density of the underlying process is known, and the Malliavin calculus method, which does not require any explicit knowledge of the density and relies only on the dynamics of the processes. We present illustrative examples for both methods. For the density-based approach, we consider Ornstein-Uhlenbeck and CARMA processes to model prices and energy volumes. For the Malliavin calculus approach, we study Ornstein-Uhlenbeck processes, jump diffusion driven by a compound Poisson process, time-changed Brownian motion processes subordinated by an inverse Gaussian (IG) process, as well as Ornstein-Uhlenbeck processes driven by a normal inverse Gaussian (NIG) process. We provide some numerical examples illustrating the implementation of the proposed formulas and demonstrating a close agreement between the resulting delta estimates.

Explore related subjects

Keep this discovery

BibTeXRIS

Fred Espen Benth, Olfa Draouil, Farouk Hammami. 2026-06-30. Efficient Computation Of Sensitivities For Derivatives In Energy Markets. https://arxiv.org/abs/2606.31220

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR