Exact first passage time distribution for nonlinear chemical reaction networks II: monomolecular reactions and a A + B - C type of second-order reaction with arbitrary initial conditions
In biochemical reaction networks, the first passage time (FPT) of a reaction quantifies the time it takes for the reaction to first occur, from the initial state. While the mean FPT historically served as a summary metric, a far more comprehensive characterization of the dynamics of the network is contained within the complete FPT distribution. The relatively uncommon theoretical treatments of the FPT distribution that have been given in the past have been confined to linear systems, with zero and first-order processes. Recently, we presented theoretically exact solutions for the FPT distribution, within nonlinear systems involving two-particle collisions, such as A+B - C. Although this research yielded invaluable results, it was based upon the assumption of initial conditions in the form of a Poisson distribution. This somewhat restricts its relevance to real-world biochemical systems, which frequently display intricate behaviour and initial conditions that are non-Poisson in nature. Our current study extends prior analyses to accommodate arbitrary initial conditions, thereby expanding the applicability of our theoretical framework and providing a more adaptable tool for capturing the dynamics of biochemical reaction networks.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Exact first passage time distribution for second-order reactions in chemical networks
The first passage time (FPT) is a generic measure that quantifies when a random quantity reaches a specific state. We consider the FTP distribution in nonlinear stochastic biochemical networks, where obtaining exact solu…
Computational EfficiencyExact analytic expressions for discrete first-passage time probability distributions in Markov networks
The first-passage time (FPT) is the time it takes a system variable to cross a given boundary for the first time. In the context of Markov networks, the FPT is the time a random walker takes to reach a particular node (t…
First passage time distribution for spiking neuron with delayed excitatory feedback
A class of spiking neuronal models with threshold 2 is considered. It is defined by a set of conditions typical for basic threshold-type models, such as the leaky integrate-and-fire (LIF) or the binding neuron model and …
Gated Self-Matching Networks for Reading Comprehension and Question Answering
In this paper, we present the gated self-matching networks for reading comprehension style question answering, which aims to answer questions from a given passage. We first match the question and passage with gated atten…
Question AnsweringReading ComprehensionCollision-Free Velocity Scheduling for Multi-Agent Systems on Predefined Routes via Inexact-Projection ADMM
In structured multi-agent transportation systems, agents often must follow predefined routes, making spatial rerouting undesirable or impossible. This paper addresses route-constrained multi-agent coordination by optimiz…