Computational identification of irreducible state-spaces for stochastic reaction networks
Ankit Gupta, Mustafa Khammash

TL;DR
This paper introduces a linear-algebraic method to identify irreducible state-spaces in stochastic reaction networks, aiding in analyzing their long-term behavior and stationary distributions, especially in infinite state-space scenarios.
Contribution
The authors develop a novel linear-algebraic procedure to decompose the state-space of stochastic reaction networks, enabling the identification of all irreducible components within infinite state-spaces.
Findings
Method effectively finds all closed communication classes in infinite state-spaces.
Decomposition simplifies analysis of long-term behavior and stationary distributions.
Application to gene-expression networks demonstrates practical utility.
Abstract
Stochastic models of reaction networks are becoming increasingly important in Systems Biology. In these models, the dynamics is generally represented by a continuous-time Markov chain whose states denote the copy-numbers of the constituent species. The state-space on which this process resides is a subset of non-negative integer lattice and for many examples of interest, this state-space is countably infinite. This causes numerous problems in analyzing the Markov chain and understanding its long-term behavior. These problems are further confounded by the presence of conservation relations among species which constrain the dynamics in complicated ways. In this paper we provide a linear-algebraic procedure to disentangle these conservation relations and represent the state-space in a special decomposed form, based on the copy-number ranges of various species and dependencies among them.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
