SearcharxivSearch

arXiv · 2603.03268

Exponential ergodicity and finite-dimensional approximation for Markovian lifts of stochastic Volterra equations

Abstract

This paper investigates the long-time asymptotics and the existence of stationary solutions for a class of stochastic Volterra equations (SVEs). To address the non-Markovian nature of SVEs, we employ a Markovian lifting technique, formulating a Markovian lift as the solution to a stochastic evolution equation (SEE) on a Gelfand triplet. Our main objective is to establish the ergodicity of this Markovian lift via the generalized Harris' theorem, which in turn yields the asymptotic results for the original SVE. Despite the challenges posed by the highly degenerate, infinite-dimensional nature of the SEE, we achieve this by constructing a generalized coupling and a distance function that exploit the structural properties arising from the non-local operators in its coefficients. Furthermore, we prove that the invariant probability measure and, more generally, the stationary law on the path space of the SEE can be weakly approximated by those of finite-dimensional SDEs. This yields a novel approximation result for the stationary solution of the original SVE, while offering a rigorous mathematical framework that supports the validity of the Markovian embedding concept widely utilized in statistical physics.

Explore related subjects

Keep this discovery

BibTeXRIS

Yushi Hamaguchi. 2026-03-03. Exponential ergodicity and finite-dimensional approximation for Markovian lifts of stochastic Volterra equations. https://arxiv.org/abs/2603.03268

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