Some network conditions for positive recurrence of stochastically modeled reaction networks
arXiv:1710.11263
Abstract
We consider discrete-space continuous-time Markov models of reaction networks and provide sufficient conditions for the following stability condition to hold: each state in a closed, irreducible component of the state space is positive recurrent; moreover the time required for a trajectory to enter such a component has finite expectation. The provided analytical results depend solely on the underlying structure of the reaction network and not on the specific choice of model parameters. Our main results apply to binary systems and our main analytical tool is the "tier structure" previously utilized successfully in the study of deterministic models of reaction networks.
arXiv commentMinor edits. Clarified statements pertaining to positive recurrence
References in corpus (4)
- A modified Next Reaction Method for simulating chemical systems with time dependent propensities and delays
- Incorporating postleap checks in tau-leaping
- A scalable computational framework for establishing long-term behavior of stochastic reaction networks
- A geometric approach to the Global Attractor Conjecture