Resumen de Computable strongly ergodic rates of convergence for continuous-time Markov chains

Yuanyuan Liu, Hanjun Zhang, Yiqiang Zhao

• In this paper, we investigate computable lower bounds for the best strongly ergodic rate of convergence of the transient probability distribution to the stationary distribution for stochastically monotone continuous-time Markov chains and reversible continuous-time Markov chains, using a drift function and the expectation of the first hitting time on some state. We apply these results to birth�death processes, branching processes and population processes.