Abstract
A particular random walk on the integers leads to a new, tractable Markov chain. Of the stationary probabilities, we discuss the existence, some analytic properties and a factorization which leads to an algorithmic procedure for their numerical computation. We also consider the positive recurrence of some variants which each call for different mathematical arguments. Analogous results are derived for a continuous version on the positive reals.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference3 articles.
1. Stochastic Decompositions in theM/G/1 Queue with Generalized Vacations
2. Probabilistic modelling requires a certain imagination;Neuts;Proceedings of the Third International Conference on Teaching Statistics (ICOTS 3),1991
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献