pith. sign in

arxiv: 1812.04299 · v1 · pith:D6IHNCPOnew · submitted 2018-12-11 · 🧬 q-bio.QM · math.PR· q-bio.MN

A finite state projection method for steady-state sensitivity analysis of stochastic reaction networks

classification 🧬 q-bio.QM math.PRq-bio.MN
keywords steady-statechainfinitemarkovmethodparameterreactionsensitivities
0
0 comments X
read the original abstract

Consider the standard stochastic reaction network model where the dynamics is given by a continuous-time Markov chain over a discrete lattice. For such models, estimation of parameter sensitivities is an important problem, but the existing computational approaches to solve this problem usually require time-consuming Monte Carlo simulations of the reaction dynamics. Therefore these simulation-based approaches can only be expected to work over finite time-intervals, while it is often of interest in applications to examine the sensitivity values at the steady-state after the Markov chain has relaxed to its stationary distribution. The aim of this paper is to present a computational method for the estimation of steady-state parameter sensitivities, which instead of using simulations, relies on the recently developed stationary Finite State Projection (sFSP) algorithm [J. Chem. Phys. 147, 154101 (2017)] that provides an accurate estimate of the stationary distribution at a fixed set of parameters. We show that sensitivity values at these parameters can be estimated from the solution of a Poisson equation associated with the infinitesimal generator of the Markov chain. We develop an approach to numerically solve the Poisson equation and this yields an efficient estimator for steady-state parameter sensitivities. We illustrate this method using several examples.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.