SearcharxivSearch

arXiv · 2209.04523

The Small-Noise Limit of the Most Likely Element is the Most Likely Element in the Small-Noise Limit

Abstract

In this paper, we study the Onsager-Machlup function and its relationship to the Freidlin-Wentzell function for measures equivalent to arbitrary infinite dimensional Gaussian measures. The Onsager-Machlup function can serve as a density on infinite dimensional spaces, where a uniform measure does not exist, and has been seen as the Lagrangian for the ``most likely element". The Freidlin-Wentzell rate function is the large deviations rate function for small-noise limits and has also been identified as a Lagrangian for the ``most likely element". This leads to a conundrum - what is the relationship between these two functions? We show both pointwise and $\Gamma$-convergence (which is essentially the convergence of minimizers) of the Onsager-Machlup function under the small-noise limit to the Freidlin-Wentzell function - and give an expression for both. That is, we show that the small-noise limit of the most likely element is the most likely element in the small noise limit for infinite dimensional measures that are equivalent to a Gaussian. Examples of measures include the law of solutions to path-dependent stochastic differential equations and the law of an infinite system of random algebraic equations.

Explore related subjects

Keep this discovery

BibTeXRIS

Zachary Selk, Harsha Honnappa. 2022-09-09. The Small-Noise Limit of the Most Likely Element is the Most Likely Element in the Small-Noise Limit. https://arxiv.org/abs/2209.04523

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