SearcharxivSearch

arXiv · 2409.01340

Probability Flow Approach to the Onsager--Machlup Functional for Jump-Diffusion Processes

Abstract

The Onsager--Machlup action functional is an important concept in statistical mechanics and thermodynamics to describe the probability of fluctuations in nonequilibrium systems. It provides a powerful tool for analyzing and predicting the behavior of complex stochastic systems. For diffusion process, the path integral method and the Girsanov transformation are two main approaches to construct the Onsager--Machlup functional. However, it is a long-standing challenge to apply these two methods to the jump-diffusion process, because the complexity of jump noise presents intrinsic technical barriers to derive the Onsager--Machlup functional. In this work, we propose a new strategy to solve this problem by utilizing the equivalent probabilistic flow between the pure diffusion process and the jump-diffusion process. For the first time, we rigorously establish the closed-form expression of the Onsager--Machlup functional for jump-diffusion processes with finite jump activity, which include an important term of the L\'{e}vy intensity at the origin. The same probability flow approach is further applied to the L\'{e}vy process with infinite jump activity, and yields a time-discrete version of the Onsager--Machlup functional.

Explore related subjects

Keep this discovery

BibTeXRIS

Yuanfei Huang, Xiang Zhou, Jinqiao Duan. 2024-09-02. Probability Flow Approach to the Onsager--Machlup Functional for Jump-Diffusion Processes. https://arxiv.org/abs/2409.01340

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