多尺度随机反应网络有效生成器的约束近似及其在条件路径采样中的应用
Constrained Approximation of Effective Generators for Multiscale Stochastic Reaction Networks and Application to Conditioned Path Sampling
AI总结：
本文提出一种不依赖准稳态假设的约束方法，用于高效计算多尺度随机系统中慢变量的有效生成器，通过求解约束系统生成器的零空间来避免昂贵的随机模拟，提升条件路径采样效率。
摘要：
多尺度随机化学动力学系统高效分析和模拟是一个持续研究的领域，面临许多理论和计算挑战。本文提出一种显著改进的约束方法，用于计算缓慢变化量的有效动力学，但不依赖准稳态假设（QSSA）。QSSA在快慢变量时间尺度差异不明显时会导致估计误差。该方法通过求解约束系统生成器的零空间来计算慢变量的有效生成器，无需昂贵的随机模拟。对于复杂系统或自身多尺度的约束子系统，可迭代应用该方法，将问题分解为多个小特征值问题的求解，利用标准方法高效处理。由于不依赖QSSA，近似有效动力学高度准确，单分子反应系统中为精确。通过数值示例和有效生成器采样慢变量路径（条件于端点）展示其优势，此任务对完整系统生成器而言计算不可行。
英文摘要：
Efficient analysis and simulation of multiscale stochastic systems of chemical kinetics is an ongoing area for research, and is the source of many theoretical and computational challenges. In this paper, we present a significant improvement to the constrained approach, which is a method for computing effective dynamics of slowly changing quantities in these systems, but which does not rely on the quasi-steady-state assumption (QSSA). The QSSA can cause errors in the estimation of effective dynamics for systems where the difference in timescales between the "fast" and "slow" variables is not so pronounced. This new application of the constrained approach allows us to compute the effective generator of the slow variables, without the need for expensive stochastic simulations. This is achieved by finding the null space of the generator of the constrained system. For complex systems where this is not possible, or where the constrained subsystem is itself multiscale, the constrained approach can then be applied iteratively. This results in breaking the problem down into finding the solutions to many small eigenvalue problems, which can be efficiently solved using standard methods. Since this methodology does not rely on the quasi steady-state assumption, the effective dynamics that are approximated are highly accurate, and in the case of systems with only monomolecular reactions, are exact. We will demonstrate this with some numerics, and also use the effective generators to sample paths of the slow variables which are conditioned on their endpoints, a task which would be computationally intractable for the generator of the full system.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
