Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-29T11:58:30.141Z Has data issue: false hasContentIssue false
  • English
  • Français

Positive random walks

Published online by Cambridge University Press:  01 July 2016

M. A. Maher
M. A. Maher*
Affiliation:
(Yale University)
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Ninth Conference on Stochastic Processes and their Applications, Evanston, Illinois, 6–10 August 1979
Information
Advances in Applied Probability , Volume 12 , Issue 2 , June 1980 , pp. 301
Copyright
Copyright © Applied Probability Trust 1980 

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

Foster, F. G. (1953) On the stochastic matrices associated with certain queueing processes. Ann. Math. Statist. 24, 355–360.Google Scholar
Kesten, H. (1976) Recurrence criteria for multi-dimensional Markov chains and multi-dimensional linear birth and death processes. Adv. Appl. Prob. 8, 58–87.Google Scholar
Kesten, H. and Runnenburg, J. Th. (1957) Priority in waiting line problems I and II. Indag. Math. 19, 312–336.Google Scholar
Kingman, J. F. C. (1961) The ergodic behaviour of random walks. Biometrika 48, 391–396.CrossRefGoogle Scholar
Malysev, V. A. (1970) Random Walks, Wiener–Hopf Equations in the Quadrant, and Galois Automorphisms (In Russian). Izd. MGU, Moscow.Google Scholar
Mertens, J. F., Samuel-Cahn, E. and Zamir, S. (1978) Necessary and sufficient conditions for recurrence and transience of Markov chains, in terms of inequalities. J. Appl. Prob. 15, 848–851.CrossRefGoogle Scholar