SearcharxivSearch

arXiv · 2607.16217

Curvature-Dependent Path Concentration in Stochastic Fast-Slow Systems with Noise on the Slow Variable

Abstract

We study stochastic fast-slow systems in which the noise acts exclusively on the slow variable: $dx = f(x,y)\,dt$, $dy = \varepsilon\,g(x,y)\,dt + \sigma\,h(y)\,dW_t$. While the path-concentration theory for noise on the fast variable is well developed, the complementary case of noise only on the slow variable has remained largely unexplored, with a recent exception treating the fold bifurcation. For general, uniformly normally-hyperbolic deterministic slow manifolds $x = X^*(y)$, we derive rigorous pathwise estimates showing that the deviation $z = x - X^*(y)$ concentrates with exponential tail bounds over the slow timescale $[0,T/\varepsilon]$. A central finding is that the It\^o correction arising from the curvature $D^2X^*$ of the slow manifold introduces a systematic $O(\sigma^2\|D^2X^*\|)$ bias that tightens the concentration bound beyond the classical $\sigma/\sqrt{\lambda_0}$ tube width. We identify a geometric critical noise scale $\sigma_c(\varepsilon) = C_0\min\!\bigl(\sqrt{\varepsilon},\, \varepsilon^{1/4} L_{\mathrm{geom}}/\sqrt{\lambda_0}\bigr)$, where $L_{\mathrm{geom}} = \sqrt{\lambda_0/(\|D^2X^*\|\|h\|^2)}$ is a local geometric scale of the manifold. For $\sigma \le \sigma_c$, the fast variable tracks the manifold to within $C\bigl(\varepsilon/\lambda_0 + \sigma^2\|D^2X^*\|\|h\|^2/(2\lambda_0) + \sigma/\sqrt{\lambda_0}\bigr)$ with probability at least $1 - e^{-\kappa/\varepsilon} - e^{-C_K}$, where $C_K > 0$ depends on the confinement of the slow dynamics. We also prove that the slow-variable adiabatic error is $O(\varepsilon + \sigma\sqrt{\varepsilon} + \sigma^2\|D^2X^*\|)$, which is dominated by classical terms when $\sigma \le \sigma_c$; hence curvature governs fast-variable path concentration but not adiabatic validity.

Explore related subjects

Keep this discovery

BibTeXRIS

Yefan Wu. 2026-06-06. Curvature-Dependent Path Concentration in Stochastic Fast-Slow Systems with Noise on the Slow Variable. https://arxiv.org/abs/2607.16217

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