SearcharxivSearch

arXiv · 2603.06815

Optimal Fluctuations for Discrete-time Markov Jump Processes

Abstract

In the last few decades, noise-induced large fluctuations and transition phenomena have garnered significant attention in a variety of scientific contexts. The concept of prehistory probability has been proposed within the framework of Langevin dynamics to illustrate the focusing effect of large fluctuation paths onto a deterministic trajectory known as the optimal path. The present paper is devoted to showing that such a focusing effect persists within the framework of discrete-time Markov jump processes. Our proof leverages large deviation theory and the concept of time reversal for Markov jump processes. A key finding is the relationship identified between the optimal path and the time reversal of a specific family of probability distributions. This theoretical framework elucidates how an essentially deterministic mechanism can emerge from rare stochastic events in discrete-time Markov jump systems.

Explore related subjects

Keep this discovery

BibTeXRIS

Feng Zhao, Jinjie Zhu, Yang Li, Xianbin Liu, Dongping Jin. 2026-03-06. Optimal Fluctuations for Discrete-time Markov Jump Processes. https://arxiv.org/abs/2603.06815

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