Search arXivSearch

arXiv · 2607.22362

A Small-Noise Analysis of Controlled Functional Differential Equations with Gaussian Noise

Abstract

We study small-noise asymptotics for controlled functional differential equations driven by additive Gaussian noise. The Gaussian noise is modeled on an abstract Wiener space, covering both classical Brownian perturbations and non-Markovian perturbations such as fractional Brownian motion. The drift coefficient is assumed to be non-anticipative, Lipschitz continuous in the state path, and of linear growth. For bounded uniformly continuous cost functionals, we prove game-theoretic lower and upper bounds for the small-noise logarithmic value functions and identify their limit whenever the associated deterministic zero-sum game has a value. In the limiting game, one player chooses the drift control, while the other selects a Cameron--Martin shift of the Gaussian noise, penalized by the corresponding quadratic energy cost. We further provide sufficient Fan-type convexity and concavity conditions under which the game has a value, thereby obtaining a full small-noise Laplace principle. The proof combines the Bou\'e--Dupuis variational representation on abstract Wiener spaces with pathwise stability of the controlled solution map and adapted finite-dimensional approximations of Cameron--Martin shifts.

Explore related subjects

Keep this discovery

BibTeXRIS

David Criens, Max Nendel. 2026-07-24. A Small-Noise Analysis of Controlled Functional Differential Equations with Gaussian Noise. https://arxiv.org/abs/2607.22362

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