Search arXivSearch

arXiv · 2208.02136

On ergodic invariant measures for the stochastic Landau-Lifschitz-Gilbert equation in 1D

Abstract

We establish existence of an ergodic invariant measure on $H^1(D,\mathbb{R}^3)\cap L^2(D,\mathbb{S}^2)$ for the stochastic Landau-Lifschitz-Gilbert equation on a bounded one dimensional interval $D$. The conclusion is achieved by employing the classical Krylov-Bogoliubov theorem. In contrast to other equations, verifying the hypothesis of the Krylov-Bogoliubov theorem is not a standard procedure. We employ rough paths theory to show that the semigroup associated to the equation has the Feller property in $H^1(D,\mathbb{R}^3)\cap L^2(D,\mathbb{S}^2)$. It does not seem possible to achieve the same conclusion by the classical Stratonovich calculus. On the other hand, we employ the classical Stratonovich calculus to prove the tightness hypothesis. The Krein-Milman theorem implies existence of an ergodic invariant measure. In case of spatially constant noise, we show that there exists a unique Gibbs invariant measure and we establish the qualitative behaviour of the unique stationary solution. In absence of the anisotropic energy and for a spatially constant noise, we are able to provide a path-wise long time behaviour result: in particular, every solution synchronises with a spherical Brownian motion and it is recurrent for large times

Explore related subjects

Keep this discovery

BibTeXRIS

Emanuela Gussetti. 2022-08-03. On ergodic invariant measures for the stochastic Landau-Lifschitz-Gilbert equation in 1D. https://arxiv.org/abs/2208.02136

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