Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-25T07:49:59.892Z Has data issue: false hasContentIssue false

Some results using general moment functions

Published online by Cambridge University Press:  09 April 2009

Walter L. Smith
Affiliation:
University of North CarolinaChapel Hill, N.C.
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.

Let {Xn} be a sequence fo independent and identically distributed random variables such that 0 <μ = εXn ≦ + ∞ and write Sn = X1+X2+ … +Xn. Letv ≧ 0 be an integer and let M(x) be a non-decreasing function of x ≧ 0 such that M(x)/x is non-increasing and M(0) > 0. Then if ε|X1νM(|X1|) < ∞ and μ < ∞ it follows that ε|Sn|νM(|Sn|) ~ (nμ)vM(nμ) as n → ∞. If μ = ∞ (ν = 0) then εM(|Sn|) = 0(n). A variety of results stem from this main theorem (Theorem 2), concerning a closure property of probability generating functions and a random walk result (Theorem 1) connected with queues.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1969

References

[1]Heyde, C. C. (1964). Two probability theorems and their application to some first passage problems. J. Austral. Math. Soc., 4, 214222.CrossRefGoogle Scholar
[2]Smith, W. L. (1967). A theorem on functions of characteristic functions and its application to some renewal theoretic random walk problems, Proceedings of the Fifth Berkely Symposium on Mathematical Statistics and Probability, Vol. II. Part 2, pp. 265309, Berkeley, University of California Press.Google Scholar
[3]Smith, W. L. and Wilkinson, W. E. (1965), Proceedings of the Symposium on Congestion Theory, Chapel Hill, University of North Carolina Press.Google Scholar
[4]Spitzer, F. (1956), A combinatorial lemma and its application to probability theory, Trans. Amer. Math. Soc., 82, 323339.CrossRefGoogle Scholar