SearcharxivSearch

arXiv · 2512.10460

The dynamic saddle-node bifurcation with noise on the slow variable

Abstract

In this work, we analyse the effect of adding Gaussian white noise to the slow variable of a slow--fast system passing through a saddle--node (or fold) bifurcation. This problem is mainly motivated by applications to non-equilibrium energy sinks. While the effect of adding noise to the fast variable, which is important for noise-induced tipping, has been previously analysed in detail, the case where the slow variable is perturbed by noise has not been considered before. Our main result is that the noise increases the slow variable on average. We compute the effect of the noise, to lowest order, on the expectation and variance of the slow variable after the bifurcation. The contribution of the noise can be explicitly expressed in terms of Airy functions. We also provide numerical simulations, which show that the expansion to lowest order matches the observations for fairly large values of the noise intensity.

Explore related subjects

Keep this discovery

BibTeXRIS

Baptiste Bergeot, Nils Berglund, Israa Zogheib. 2025-12-11. The dynamic saddle-node bifurcation with noise on the slow variable. https://doi.org/10.1088/1361-6544%2Fae7ec0

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