Table of Contents
Fetching ...

Polynomial mixing for the stochastic Schrödinger equation with large damping in the whole space

Hung D. Nguyen, Kihoon Seong

TL;DR

The paper addresses the mixing behavior of the stochastic nonlinear Schrödinger equation on $\mathbb{R}^d$ with $d\le 3$ in the regime of large damping. It develops a coupling approach enhanced by pathwise Strichartz estimates and Lyapunov-type controls to prove the existence of a unique invariant measure and to establish an algebraic (polynomial) rate of convergence to equilibrium for a broad class of observables. The main contributions include extending unique ergodicity and providing polynomial mixing rates in the unbounded domain, with refined nonlinear and noise-regularity assumptions (notably $Q:U\to H^3$ for mixing and $0<\sigma<\tfrac{3}{2}$ in $d=3$). This work bridges results between bounded domains and the whole space for dispersive SPDEs and highlights how large damping enables effective coupling without invoking Girsanov transforms. The methods and estimates presented have potential implications for understanding long-time behavior of dispersive SPDEs under strong dissipation in unbounded settings.

Abstract

We study the long-time mixing behavior of the stochastic nonlinear Schrödinger equation in $\mathbb{R}^d$, $d\le 3$. It is well known that, under a sufficiently strong damping force, the system admits unique ergodicity, although the rate of convergence toward equilibrium has remained unknown. In this work, we address the mixing property in the regime of large damping and establish that solutions are attracted toward the unique invariant probability measure at polynomial rates of arbitrary order. Our approach is based on a coupling strategy with pathwise Strichartz estimates.

Polynomial mixing for the stochastic Schrödinger equation with large damping in the whole space

TL;DR

The paper addresses the mixing behavior of the stochastic nonlinear Schrödinger equation on with in the regime of large damping. It develops a coupling approach enhanced by pathwise Strichartz estimates and Lyapunov-type controls to prove the existence of a unique invariant measure and to establish an algebraic (polynomial) rate of convergence to equilibrium for a broad class of observables. The main contributions include extending unique ergodicity and providing polynomial mixing rates in the unbounded domain, with refined nonlinear and noise-regularity assumptions (notably for mixing and in ). This work bridges results between bounded domains and the whole space for dispersive SPDEs and highlights how large damping enables effective coupling without invoking Girsanov transforms. The methods and estimates presented have potential implications for understanding long-time behavior of dispersive SPDEs under strong dissipation in unbounded settings.

Abstract

We study the long-time mixing behavior of the stochastic nonlinear Schrödinger equation in , . It is well known that, under a sufficiently strong damping force, the system admits unique ergodicity, although the rate of convergence toward equilibrium has remained unknown. In this work, we address the mixing property in the regime of large damping and establish that solutions are attracted toward the unique invariant probability measure at polynomial rates of arbitrary order. Our approach is based on a coupling strategy with pathwise Strichartz estimates.
Paper Structure (12 sections, 20 theorems, 312 equations)

This paper contains 12 sections, 20 theorems, 312 equations.

Key Result

Theorem 1.1

In dimension $d\le 3$, let $u(t;u_0)$ be the solution of eqn:Schrodinger:original with initial condition $u_0$. 1. Under appropriate assumptions on $\sigma$ and $QW$, for all $\lambda$ large enough, there exists a unique invariant probability measure for eqn:Schrodinger:original. 2. Suppose $\sigma$ In the above, $C$ is a positive constant independent of $t$.

Theorems & Definitions (42)

  • Theorem 1.1
  • Proposition 2.3
  • Proposition 2.4
  • Theorem 2.5
  • Remark 2.6
  • Theorem 2.8
  • Remark 2.9
  • Lemma 3.1
  • proof
  • Lemma 3.2
  • ...and 32 more