Computing large deviation rate functions of entropy production for diffusion processes by an interacting particle method
Zhizhang Wu, Renaud Raquépas, Jack Xin, Zhiwen Zhang
TL;DR
This work develops an interacting particle method (IPM) to compute the large-deviation rate function $I^bepsilon$ for entropy production in diffusion processes by approximating the principal eigenvalue $bb^{bepsilon,balpha}$ of a non-self-adjoint elliptic generator via a discretized Feynman--Kac semigroup. The authors establish stability and convergence results for the time-discretized semigroup and its spectral radius, and implement an IPM that handles unbounded domains and high dimensions, using burn-in and cross-$bepsilon$ initialization to accelerate convergence. Numerical experiments demonstrate convergence to the vanishing-noise limits $ bb^{0,balpha}$ and $I^0(s)$ in dimensions up to $d=16$, and show the method's ability to capture singular behaviors and multimodal invariant measures even when explicit formulas are unavailable. The results provide a scalable tool for evaluating large-deviation rate functions in stochastic thermodynamics and related areas, with potential extensions to higher-order discretizations and error analysis.
Abstract
We develop an interacting particle method (IPM) for computing the large deviation rate function of entropy production for diffusion processes, with emphasis on the vanishing-noise limit and high dimensions. The crucial ingredient to obtain the rate function is the computation of the principal eigenvalue $λ$ of elliptic, non-self-adjoint operators. We show that this principal eigenvalue can be approximated in terms of the spectral radius of a discretized evolution operator, which is obtained from an operator splitting scheme and an Euler--Maruyama scheme with a small time step size. We also show that this spectral radius can be accessed through a large number of iterations of this discretized semigroup, which is suitable for computation using the IPM. The IPM applies naturally to problems in unbounded domains and scales easily to high dimensions. We show numerical examples of dimensions up to 16, and the results show that our numerical approximation of $λ$ converges to the analytical vanishing-noise limit within visual tolerance with a fixed number of particles and a fixed time step size. It is numerically shown that the IPM can adapt to singular behaviors in the vanishing-noise limit. We also apply the IPM to explore situations with no explicit formulas of the vanishing-noise limit. Our paper appears to be the first one to obtain numerical results of principal eigenvalue problems for non-self-adjoint operators in such high dimensions.
