SearcharxivSearch

arXiv · 2108.08351

The cutoff phenomenon in Wasserstein distance for nonlinear stable Langevin systems with small L\'evy noise

Abstract

This article establishes the cutoff phenomenon in the Wasserstein distance for systems of nonlinear ordinary differential equations with a unique coercive stable fixed point subject to general additive Markovian noise in the limit of small noise intensity. This result generalizes the results shown in Barrera, H\"ogele, Pardo (EJP2021) in a more restrictive setting of Blumenthal-Getoor index $\alpha>3/2$ to the formulation in Wasserstein distance, which allows to cover the case of general L\'evy processes with some given moment. The main proof techniques are based on the close control of the errors in a version of the Hartman-Grobman theorem and the adaptation of the linear theory established in Barrera, H\"ogele, Pardo (JSP2021). In particular, they rely on the precise asymptotics of the nonlinear flow and the nonstandard shift linearity property of the Wasserstein distance, which is established by the authors in (JSP2021). Main examples are the Fermi-Pasta-Ulam-Tsingou gradient flow and coercive nonlinear oscillators subject to small (and possibly degenerate) Brownian or arbitrary $\alpha$-stable noise.

Explore related subjects

Keep this discovery

BibTeXRIS

Gerardo Barrera, Michael A. Högele, Juan Carlos Pardo. 2021-08-18. The cutoff phenomenon in Wasserstein distance for nonlinear stable Langevin systems with small L\'evy noise. https://doi.org/10.1007/s10884-022-10138-1

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