SearcharxivSearch

arXiv · 2607.05652

The Pathwise Approach to Metastability and its Applications to Galves--L\"ocherbach Models

Abstract

Metastability is the tendency of a system to dwell for a very long time near an apparently stable equilibrium before a rare fluctuation drives it, on a comparatively short time scale, towards another. Among the rigorous frameworks developed to capture this phenomenon, the pathwise approach proceeds by identifying the ``typical'' trajectories of the stochastic dynamics at hand and estimating their probabilities. In this article we review the pathwise approach and its application to the Galves--L\"ocherbach (GL) class of stochastic models of spiking neural networks. After recalling the conceptual and historical roots of the theory -- which goes from chemistry to rigorous probability theory, with fundamental ideas coming mainly from statistical physics -- and illustrating them on two classical examples, we give a general definition encompassing the known variants of the GL model and survey the metastability results already established for some of these variants. As far as we can, we do so in a self-contained fashion, and we sketch the proofs when possible, highlighting their common structure. We close with a discussion on open problems and point to possible further directions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Morgan André, Kádmo Laxa. 2026-07-06. The Pathwise Approach to Metastability and its Applications to Galves--L\"ocherbach Models. https://arxiv.org/abs/2607.05652

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