Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-09T22:40:25.286Z Has data issue: false hasContentIssue false

Wiener-Hopf methods, decompositions, and factorisation identities for maxima and minima of homogeneous random processes

Published online by Cambridge University Press:  01 July 2016

Priscilla Greenwood*
Affiliation:
University of British Columbia

Abstract

Some Wiener-Hopf type results are collected, related and given more direct proofs. Spitzer's random-walk method for the Wiener-Hopf integral equation also produces his factorisation relating functionals of maxima and minima. Transform equations are interpreted as decompositions of time-changed processes. Discrete- and continuous-time versions are related. Prabhu's factorisation for generators is equivalent to Fristedt's Lévy measure factorisation and to process decomposition.

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1975 

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

[1] Bingham, N. H. (1975) Fluctuation theory in continuous time. Adv. App. Prob. 7, 705766.Google Scholar
[2] Borovkov, A. A. (1970) Factorization identities and properties of the distribution of the supremum of sequential sums. Theor. Probability Appl. 15, 359402.CrossRefGoogle Scholar
[3] Feller, W. (1966) An Introduction to Probability Theory and its Applications, Vol. II. John Wiley, New York.Google Scholar
[4] Fristedt, B. (1974) Sample functions of stochastic processes with stationary, independent increments. Adv. Prob. 3, 241395.Google Scholar
[5] Greenwood, P. (1973) On Prabhu's factorization of Lévy generators. Z. Wahrscheinlichkeitsth. 27, 7577.Google Scholar
[6] Greenwood, P. Wiener-Hopf decomposition of random walks and Lévy processes. To appear.Google Scholar
[7] Huff, B. (1969) The strict subordination of a differential process. Sankhyā A 31, 403412.Google Scholar
[8] Kiefer, J. and Wolfowitz, J. (1955) On the theory of queues with many servers. Trans. Amer. Math. Soc. 78, 118.Google Scholar
[9] Lindley, D. V. (1952) The theory of queues with a single server. Proc. Camb. Phil. Soc. 48, 277289.Google Scholar
[10] Payley, R. and Wiener, N. (1934) Fourier transforms in the complex domain. Amer. Math. Soc. Colloq. Pub. 19, New York.Google Scholar
[11] Prabhu, N. U. (1972) Wiener-Hopf factorization for convolution semi-groups. Z. Wahrscheinlichkeitsth. 23, 103113.Google Scholar
[12] Rogozin, B. A. (1966) On the distribution of functionals related to boundary problems for processes with independent increments. Theor. Prob. Appl. 11, 580591.Google Scholar
[13] Spitzer, F. (1956) A combinatorial lemma and its application to probability theory. Trans. Amer. Math. Soc. 82, 323339.CrossRefGoogle Scholar
[14] Spitzer, F. (1957) The Wiener-Hopf equation whose kernel is a probability density. Duke Math. J. 24, 327343.CrossRefGoogle Scholar
[15] Spitzer, F. (1964) Principles of Random Walk. Van Nostrand, New York.Google Scholar