arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2011.11476math.PRcond-mat.stat-mech
收藏

乘性噪声下的 Langevin 方程:通过时间离散方法获得唯一性、自洽性及新的求解方法

Langevin equations with multiplicative noise: uniqueness, self-consistency and new solution methods by a time-discrete approach

Dietrich Ryter

AI总结:

本文提出时间离散方法构造乘性噪声 Langevin 方程的路径增量,消除其与 Fokker-Planck 方程的不一致,并证明连续时间极限对应反 Ito 积分,可精确计算任意时刻路径与密度。

摘要:

时间离散方法避免了对“积分意义”的假设。新的路径增量(在一个短时间步长内)在该步长的阶数上是完整的,并且当噪声为乘性噪声时不服从高斯分布;这消除了现有方法与 Fokker-Planck 方程之间的不一致。借助 Markov 性质,这些增量可以在连续区间内累积,从而得到任意时刻的解。在一维情形下,更一般地在某一条件下,本文证明了连续时间极限存在,并使路径得到“反 Ito”积分;因此时间步长可以任意缩小。由于增量除均值外还在模(mode)上与 FPE 一致,路径的数值计算尤为精确。在上述条件下,FPE 具有简单形式,并可在短时间内显式求解;这使得利用 Markov 性质计算任意时刻的密度函数成为可能。

英文摘要:

A time-discrete approach avoids the assumption of an 'integration sense'. New path increments (in a short time step) are complete in the order of that step, and not Gaussian distributed when the noise is multiplicative; this eliminates an existing mismatch with the Fokker-Planck equations. By the Markov property these increments can be accumulated in consecutive intervals, to yield the solution for any times. In one dimension, more generally also under a certain condition, it is shown that the limit of continuous time exists and results in the 'anti-Ito' intrgral for the paths; the time step can therefore be diminished arbitrarily. The numerical computation of the paths is particularly accurate, due to increments that agree with the FPE by the mode, in addition to the mean. Under the above condition the FPE takes a simple form and can explicitly be solved for short times; this allows the computation of the density function for any times, by use of the Markov property.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑