Papers › Steady State Sensitivity Analysis of Continuous Time Markov Chains
Steady State Sensitivity Analysis of Continuous Time Markov Chains
Ting Wang, Petr Plechac
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper we study Monte Carlo estimators based on the likelihood ratio approach for steady-state sensitivity. We first extend the result of Glynn and Olvera-Cravioto [doi:doi: 10.1287/stsy.2018.002] to the setting of continuous time Markov chains with a countable state space which include models such as stochastic reaction kinetics and kinetic Monte Carlo lattice system. We show that the variance of the centered likelihood ratio estimators does not grow in time. This result suggests that the centered likelihood ratio estimators should be favored for sensitivity analysis when the mixing time of the underlying continuous time Markov chain is large, which is typically the case when systems exhibit multi-scale behavior. We demonstrate a practical implication of this analysis on a numerical benchmark of two examples for the biochemical reaction networks.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections