arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.11792math.NAcs.NAphysics.bio-phphysics.comp-ph
收藏

用于大型反应网络随机描述的分层动态低秩算法

A hierarchical dynamical low-rank algorithm for the stochastic description of large reaction networks

Lukas Einkemmer, Julian Mangott, Martina Prugger

AI总结:

本文提出基于二叉树张量网络的动态低秩算法,通过分层划分反应网络降低动力学化学主方程的维度灾难,在lambda噬菌体模型和反应级联算例中相比蒙特卡洛方法显著减少内存并提升精度与计算性能。

摘要:

利用动力学化学主方程(CME)对化学反应网络进行随机描述对于研究生物细胞具有重要意义,但它面临维度灾难:需要存储的数据量随化学物种数量呈指数增长,因而超出了常见计算设备处理现实问题的能力。因此,动态低秩近似等随时间变化的模型降阶技术成为理想选择。本文提出了一种基于二叉树张量网络的动力学CME动态低秩算法。该方法通过将反应网络分层划分为若干分区来降低问题的维度,只有跨越分区的反应才会产生近似误差。我们通过两个数值算例(一个5维lambda噬菌体模型和一个20维反应级联)证明,与蒙特卡洛方法相比,所提方法大幅减少了内存消耗,并展现出更高的计算性能和更好的精度。

英文摘要:

The stochastic description of chemical reaction networks with the kinetic chemical master equation (CME) is important for studying biological cells, but it suffers from the curse of dimensionality: The amount of data to be stored grows exponentially with the number of chemical species and thus exceeds the capacity of common computational devices for realistic problems. Therefore, time-dependent model order reduction techniques such as the dynamical low-rank approximation are desirable. In this paper we propose a dynamical low-rank algorithm for the kinetic CME using binary tree tensor networks. The dimensionality of the problem is reduced in this approach by hierarchically dividing the reaction network into partitions. Only reactions that cross partitions are subject to an approximation error. We demonstrate by two numerical examples (a 5-dimensional lambda phage model and a 20-dimensional reaction cascade) that the proposed method drastically reduces memory consumption and shows improved computational performance and better accuracy compared to a Monte Carlo method.

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

↑