Abstract
In this paper we are interested in bounding or calculating the additive functionals of the first return time on a set for discrete-time Markov chains on a countable state space, which is motivated by investigating ergodic theory and central limit theorems. To do so, we introduce the theory of the minimal nonnegative solution. This theory combined with some other techniques is proved useful for investigating the additive functionals. This method is used to study the functionals for discrete-time birth-death processes, and the polynomial convergence and a central limit theorem are derived.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference21 articles.
1. Poisson's equation for the recurrent M/G/1 queue
2. Ergodicity for discrete-time random walks;Mao;Beijing Shifan Daxue Xuebao,2002
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献