SOME BOUNDS ON THE ERROR IN APPROXIMATING TRANSITION-PROBABILITIES IN CONTINUOUS-TIME MARKOV-PROCESSES

被引:4
|
作者
ANGUS, JE
机构
关键词
INEQUALITIES; COUPLING; MATRIX EXPONENTIAL;
D O I
10.1137/1034005
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Ross (1987) proposed a method of approximating the matrix of transition probabilities P(t) of a continuous-time Markov Process that, roughly speaking, amounts to P(t) = exp(tR) almost-equal-to (I-tR/n)-n, where R is the infinitesimal matrix of the Markov process and I is the identity matrix. It is shown using probabilistic arguments that the error in using this approximation is bounded by a term of order 1/n for fixed t.
引用
收藏
页码:110 / 113
页数:4
相关论文
共 50 条