Search arXiv⌕ Search

arXiv · 2610.30835

Central limit theorem for the Smoluchowski--Kramers approximation

Abstract

We establish the central limit theorem (CLT) for Smoluchowski--Kramers approximation of Langevin equations with state-dependent, possibly non-symmetric friction and multiplicative noise. To the best of our knowledge, this is the first such result, even in the case of constant friction and additive noise. The result differs in an essential way from classical averaging CLTs and reveals a new two-scale fluctuation phenomenon. The normalized difference process retains a persistent fast component and is generally not tight in $C([0,T];\mathbb{R}^d)$, thus the usual continuous-path CLT cannot hold. We derive an exact decomposition of the normalized difference into an accumulated slow fluctuation and a rapidly relaxing velocity correction. The auxiliary slow fluctuation converges to a linear diffusion driven by both the original Brownian motion and an additional independent Brownian noise whose effective covariance is characterized explicitly through a quadratic Poisson corrector. For every fixed $t>0$, the fast correction converges conditionally to its local Gaussian equilibrium. Consequently, the fixed-time fluctuation limit is identified as a Gaussian mixture: $$ \frac{\bar X_t-X_t^\varepsilon}{\sqrt{\varepsilon}} \Longrightarrow \bar Y_t+N^{1/2}(\bar X_t)ξ, $$ where $\bar X_t$ is the overdamped limit, $\bar Y_t$ is the limiting slow fluctuation, $N$ is the covariance of the terminal velocity correction and solves a Lyapunov equation, and $ξ$ is a standard Gaussian random variable independent of $(\bar X_t,\bar Y_t)$. A quantitative convergence rate is also provided. The result fills the remaining gap in the asymptotic theory of the overdamped approximation at the central limit scale, complementing the existing law of large numbers, moderate deviation and large deviation results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yun Li, Longjie Xie, Li Yang, Qianning Zhang. 2026-10-22. Central limit theorem for the Smoluchowski--Kramers approximation. https://arxiv.org/abs/2610.30835

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Multiple SLEs and Dyson Brownian motion: transition density and Green's function

We consider multiple chordal Schramm-Loewner evolution (SLE) with $κ\in (0,4]$. Under common-time parameterization, we show that the transition density of the driving function of multiple chordal SLEs can be given by the transition density of Dyson Brownian motion and Green's function. This is a companion paper of [FWY24].

math.PR↗

Asymptotics of the free path length in the periodic Lorentz gas in the Boltzmann-Grad limit

We study the distribution of the free path length in the periodic Lorentz gas in the Boltzmann-Grad limit. For any unimodular Euclidean lattice and any smooth initial velocity distribution, we establish an asymptotic formula for the distribution function of the free path length with a polynomial rate of convergence. The proof combines the dynamical interpretation of the free path length in terms of expanding translates of horospherical orbits on the space of affine lattices, due to Marklof--Strömbergsson, with the effective equidistribution results of Kleinbock--Margulis and Kim. This extends the asymptotic formula of Boca--Zaharescu for the planar case to arbitrary dimension.

math.PR↗

The smallest singular value for rectangular random matrices with Lévy entries

Let $X=(x_{ij})\in\mathbb{R}^{N\times n}$ be a rectangular random matrix with i.i.d. entries (we assume $N/n\to\mathbf{a}>1$), and denote by $σ_{min}(X)$ its smallest singular value. When entries have mean zero and unit second moment, the celebrated work of Bai-Yin and Tikhomirov show that $n^{-\frac{1}{2}}σ_{min}(X)$ converges almost surely to $\sqrt{\mathbf{a}}-1.$ However, little is known when the second moment is infinite. In this work we consider symmetric entry distributions satisfying $\mathbb{P}(|x_{ij}|>t)\asymp t^{-α}$ for some $α\in(0,2)$, and prove that $σ_{min}(X)$ can be determined up to a log factor with high probability: for any $D>0$, with probability at least $1-n^{-D}$ we have $$C_1n^{\frac{1}α}(\log n)^\frac{2(α-2)}α\leq σ_{min}(X)\leq C_2n^{\frac{1}α}(\log n)^\frac{α-2}{2α}$$ for some constants $C_1,C_2>0$. The upper bound was derived in a recent work of Bao, Lee and Xu \cite{bao2024phase2} but the lower bound is new and answers a problem posed in that paper in a weaker form. This appears to be the first determination of $σ_{min}(X)$ in the $α$-stable case with a correct leading order of $n$, as previous anti-concentration arguments only yield lower bound $n^\frac{1}{2}$. The same lower bound holds for $σ_{min}(X+B)$ for any fixed rectangular matrix $B$ with no assumption on its operator norm. The case of diverging aspect ratio is also computed.

math.PR↗