arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2412.06291math.NAcs.NAmath.DSmath.PR
收藏

关于由莱维过程驱动的相互作用粒子系统随机批方法(RBM)

On Random Batch Methods (RBM) for interacting particle systems driven by Lévy processes

Duke University(杜克大学)

Jian-Guo Liu, Yuliang Wang

AI总结:

本文提出了一种由莱维噪声驱动的相互作用粒子系统随机批方法,通过将强相互作用替换为弱相互作用,显著降低计算成本并保证收敛性。

摘要:

在许多现实世界场景中,底层的随机波动是非高斯分布的,特别是在出现重尾数据分布的情况下。一个典型的非高斯现象需要莱维噪声,它可以容纳跳跃和极端变化。我们提出了由莱维噪声驱动的相互作用粒子系统的随机批方法(RBM-Lévy),可以视为Jin等人在2020年提出的原始RBM算法的扩展。在我们的RBM-Lévy算法中,N个粒子被随机分成大小为p的小批,且仅在每个批次内发生短暂的相互作用。然后重新洗牌粒子并重复这一洗牌和相互作用过程。换句话说,通过将强相互作用力替换为弱相互作用力,RBM-Lévy将计算成本从每个时间步的O(N²)大幅降低到O(pN)。同时,所产生的动态收敛到原始的相互作用粒子系统,即使在出现莱维跳跃时也是如此。我们严格证明了在Wasserstein距离下的收敛性,假设莱维测度的二阶矩是有限或无限的。一些数值例子被给出以验证我们的收敛速率。

英文摘要:

In many real-world scenarios, the underlying random fluctuations are non-Gaussian, particularly in contexts where heavy-tailed data distributions arise. A typical example of such non-Gaussian phenomena calls for Lévy noise, which accommodates jumps and extreme variations. We propose the Random Batch Method for interacting particle systems driven by Lévy noises (RBM-Lévy), which can be viewed as an extension of the original RBM algorithm in [Jin et al. J Compt Phys, 2020]. In our RBM-Lévy algorithm, $N$ particles are randomly grouped into small batches of size $p$, and interactions occur only within each batch for a short time. Then one reshuffles the particles and continues to repeat this shuffle-and-interact process. In other words, by replacing the strong interacting force by the weak interacting force, RBM-Lévy dramatically reduces the computational cost from $O(N^2)$ to $O(pN)$ per time step. Meanwhile, the resulting dynamics converges to the original interacting particle system, even at the appearance of the Lévy jump. We rigorously prove this convergence in Wasserstein distance, assuming either a finite or infinite second moment of the Lévy measure. Some numerical examples are given to verify our convergence rate.

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

↑