An efficient finite difference method for parameter sensitivities of continuous time Markov chains
From MaRDI portal
Publication:4903756
Abstract: We present an efficient finite difference method for the computation of parameter sensitivities that is applicable to a wide class of continuous time Markov chain models. The estimator for the method is constructed by coupling the perturbed and nominal processes in a natural manner, and the analysis proceeds by utilizing a martingale representation for the coupled processes. The variance of the resulting estimator is shown to be an order of magnitude lower due to the coupling. We conclude that the proposed method produces an estimator with a lower variance than other methods, including the use of Common Random Numbers, in most situations. Often the variance reduction is substantial. The method is no harder to implement than any standard continuous time Markov chain algorithm, such as "Gillespie's algorithm." The motivating class of models, and the source of our examples, are the stochastic chemical kinetic models commonly used in the biosciences, though other natural application areas include population processes and queuing networks.
Recommendations
- Steady-state sensitivity analysis of continuous time Markov chains
- Variance of finite difference methods for reaction networks with non-Lipschitz rate functions
- Efficient finite-difference method for computing sensitivities of biochemical reactions
- Efficient stochastic sensitivity analysis of discrete event systems
- Estimation of parameter sensitivities for stochastic reaction networks using tau-leap simulations
Cited in
(22)- Healthcare-associated \textit{Clostridium difficile} infections are sustained by disease from the community
- Stochastic representations of ion channel kinetics and exact stochastic simulation of neuronal dynamics
- Parameter sensitivity analysis for biochemical reaction networks
- Low variance couplings for stochastic models of intracellular processes with time-dependent rate functions
- Sensitivity analysis for multiscale stochastic reaction networks using hybrid approximations
- Exact variance-reduced simulation of lattice continuous-time Markov chains with applications in reaction networks
- A fast and efficient two-grid method for solving \(d\)-dimensional Poisson equations
- Path-space information bounds for uncertainty quantification and sensitivity analysis of stochastic dynamics
- Efficiency of the Girsanov transformation approach for parametric sensitivity analysis of stochastic chemical kinetics
- An asymptotic relationship between coupling methods for stochastically modeled population processes
- Stability and Strong Convergence for Spatial Stochastic Kinetics
- Steady-state sensitivity analysis of continuous time Markov chains
- Efficient finite-difference method for computing sensitivities of biochemical reactions
- Estimation of parameter sensitivities for stochastic reaction networks using tau-leap simulations
- Quantification of model uncertainty on path-space via goal-oriented relative entropy
- On the validity of the Girsanov transformation method for sensitivity analysis of stochastic chemical reaction networks
- Variance of finite difference methods for reaction networks with non-Lipschitz rate functions
- Applications of Magnus expansions and pseudospectra to Markov processes
- Unbiased estimation of second-order parameter sensitivities for stochastic reaction networks
- GradInf: Gradient Estimation as Probabilistic Inference
- Variance-reduced simulation of lattice discrete-time Markov chains with applications in reaction networks
- Markovian dynamics on complex reaction networks
This page was built for publication: An efficient finite difference method for parameter sensitivities of continuous time Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903756)
