Approximate adaptive uniformization of continuous-time Markov chains

被引:5
|
作者
Andreychenko, Alexander [1 ]
Sandmann, Werner [1 ]
Wolf, Verena [1 ]
机构
[1] Saarland Univ, Dept Comp Sci, Campus E1 3, D-66123 Saarbrucken, Germany
关键词
Continuous-time Markov chain; Transient probability distribution; Uniformization; Randomization; Discrete-time conversion; Dynamic state space truncation; MODELS; TRUNCATION; NETWORKS;
D O I
10.1016/j.apm.2018.05.009
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We consider the approximation of transient (time dependent) probability distributions of discrete-state continuous-time Markov chains on large, possibly infinite state spaces. A framework for approximate adaptive uniformization is provided, which generalizes the well-known uniformization technique and many of its variants. Based on a birth process and a discrete-time Markov chain a computationally tractable approximating process/model is constructed. We investigate the theoretical properties of this process and prove that it yields computable lower and upper bounds for the desired transient probabilities. Finally, we discuss different specific ways of performing approximate adaptive uniformization and analyze the corresponding approximation errors. The application is illustrated by an example of a stochastic epidemic model. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:561 / 576
页数:16
相关论文
共 50 条