SearcharxivSearch

arXiv · 2509.21608

Kolmogorov equations for stochastic Volterra processes with singular kernels

Abstract

We associate backward and forward Kolmogorov equations to a class of fully nonlinear Stochastic Volterra Equations (SVEs) with convolution kernels $K$ that are singular at the origin. Working on a carefully chosen Hilbert space $\mathcal{H}_1$, we rigorously establish a link between solutions of SVEs and Markovian mild solutions of a Stochastic Partial Differential Equation (SPDE) of transport-type. Then, we obtain two novel It\^o formulae for functionals of mild solutions and, as a byproduct, show that their laws solve corresponding Fokker-Planck equations. Finally, we introduce a natural notion of "singular" directional derivatives along $K$ and prove that (conditional) expectations of SVE solutions can be expressed in terms of the unique solution to a backward Kolmogorov equation on $\mathcal{H}_1$. Our analysis relies on stochastic calculus in Hilbert spaces, the reproducing kernel property of the state space $\mathcal{H}_1,$ as well as crucial invariance and smoothing properties that are specific to the SPDEs of interest. In the special case of singular power-law kernels, our conditions guarantee well-posedness of the backward equation either for all values of the Hurst parameter $H,$ when the noise is additive, or for all $H>1/4$ when the noise is multiplicative.

Explore related subjects

Keep this discovery

BibTeXRIS

Ioannis Gasteratos, Alexandre Pannier. 2025-09-25. Kolmogorov equations for stochastic Volterra processes with singular kernels. https://arxiv.org/abs/2509.21608

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