Hostname: page-component-848d4c4894-m9kch Total loading time: 0 Render date: 2024-06-08T22:39:45.427Z Has data issue: false hasContentIssue false

The joint distribution of occupation totals for a simple random walk

Published online by Cambridge University Press:  09 April 2009

V. D. Barnett
Affiliation:
University of Birmingham.
Rights & Permissions [Opens in a new window]

Summary

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A great deal of attention has been given in the literature to the various properties of the simple binomial random walk. Explicit expressions are available for first passage times, absorption probabilities, average duration of the walk up to absorption and other quantities of interest. One aspect of the behaviour of this work which has, however, attracted little attention is the form of the distribution of occupation totals. This paper is devoted to the derivation of an explict expression for the joint probility generating function of the occupation totals up to absorption, for the binomial random walk in the presence of two absorbing points. The appropriate marginal form of this p.g.f. yields the distribution of the occupation total, and expected occupation total, at any particular lattice point. The limiting forms of these results provide explicit expressions for the corresponding quatities in the case of a binomial random walk having a single absorbing point and, where relevent, in the case of the unrestricted binomial random walk.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1964

References

[1]Good, I. J. (1961), The frequency count of a finite Markov chain and the transition to continuous time, Ann. Math. Stat. 32, 4149.CrossRefGoogle Scholar
[2]Kemperman, (1961), The Passage Problem for a Stationary Markov Chain, Univ. of Chicago Press.CrossRefGoogle Scholar
[3]Feller, W. (1960), An Introduction to Probability Theory and its Applications, I. 2nd Edition. Wiley, New York.Google Scholar
[4]Kemeny, J. G. and Snell, J. L. (1960), Finite Markov Chains, Van Nostrand, Princeton, N.J., U.S.A.Google Scholar
[5]Lindley, D. V. (1952), The theory of queues with a single server, Proc. Camb. Phil. Soc. 48, 277289.CrossRefGoogle Scholar