Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-28T16:16:42.649Z Has data issue: false hasContentIssue false

Drift vectors are not sufficient to determine recurrence of a Markov chain on ℤ3+

Published online by Cambridge University Press:  14 July 2016

Mitchell Kotler*
Affiliation:
University of Massachusetts, Amherst
*
Postal address: Department of Mathematics and Statistics, UMass Amherst, Amherst, MA 01003, USA.

Abstract

For a Markov chain in n = 2, drift vectors (conditional expected jumps) on the interior and the boundaries distinguish between recurrence and transience. The result of this paper is that the analogous proposition in the n = 3 case fails.

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1994 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Fayolle, G. (1989) On random walks arising in queueing systems: ergodicity and transience via quadratic forms as Lyapounov functions – Part I. Queueing Systems 5, 167184.CrossRefGoogle Scholar
Foster, F. G. (1953) On the stochastic matrices associated with certain queueing processes. Ann. Math. Statist. 24, 355360.CrossRefGoogle Scholar
Malyshev, V. A. (1972) Classification of two-dimensional positive random walks and almost linear semi-martingales. Sov. Math. Dokl. 13, 136139.Google Scholar
Rosenkrantz, W. (1989) Ergodicity conditions for two-dimensional Markov chains on the positive quadrant. Prob. Theory Rel. Fields 83, 309319.Google Scholar