SearcharxivSearch

arXiv · 2502.11699

Mixing for dynamical systems driven by stationary noises

Abstract

The paper deals with the problem of long-time asymptotic behaviour of solutions for classes of ODEs and PDEs, perturbed by stationary noises. The latter are not assumed to be $\delta$-correlated in time, so that the evolution in question is not necessarily Markovian. We first prove an abstract result which imply the mixing for random dynamical systems satisfying appropriate dissipativity and controllability conditions. It is applicable to a large class of evolution equations, and we illustrate it on the examples of a chain of anharmonic oscillators coupled to heat reservoirs, the 2d Navier-Stokes system, and a complex Ginzburg-Landau equation. Our results also apply to the general theory of random processes on the 1d lattice and allow one to get for them results related to Dobrushin's theorems on reconstructing processes via their conditional distributions. The proof is based on an iterative construction with quadratic convergence. It uses the method of Kantorovich functional, introduced in [KPS02, Kuk02, Kuk06] in the context of randomly forced PDEs, and some ideas suggested in [Shi15, KNS20] to prove mixing with the help of controllability properties of an associated system

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergei Kuksin, Armen Shirikyan. 2025-02-17. Mixing for dynamical systems driven by stationary noises. https://arxiv.org/abs/2502.11699

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