Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-24T18:45:10.764Z Has data issue: false hasContentIssue false
  • English
  • Français

On upcrossing inequalities for subadditive superstationary processes

Published online by Cambridge University Press:  19 September 2008

Michael Krawczak
Michael Krawczak
Affiliation:
Institut für Mathematische Stochastik, Lotzestr. 13, D-3400 Göttingen, West Germany
Rights & Permissions [Opens in a new window]

Abstract

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.

Bishop [2]has given a proof of Birkhoff's ergodic theorem by establishing upcrossing inequalities similar to those of Doob. Such inequalities can be considered as quantitative improvements of convergence theorems: while convergence a.e. means that the number of upcrossings of any interval is a.e. finite, they assert integrability and prove bounds for the integrals. The main point of this paper is to prove upcrossing inequalities for the class of subadditive superstationary processes introduced by Abid [1] as a common generalization of Kingman's [5] subadditive stationary processes and Krengel's [6] superstationary processes. We make use of ideas of Smeltzer [7] who handled the subadditive stationary discrete parameter case in his unpublished thesis. In the continuous parameter case our upcrossing inequality requires more restrictive conditions than the corresponding convergence theorem, due to Hachem [3]. We actually show by example that the number of upcrossings need not be integrable under the assumptions of Hachem even for additive stationary processes.

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 5 , Issue 3 , September 1985 , pp. 409 - 416
Copyright
Copyright © Cambridge University Press 1985

References

REFERENCES

[1]Abid, M.. Un théorème ergodique pour des processus sousadditifs et sur-stationnaires. C.R. Acad. Sc. Paris, 287, A (1978), 149–152.Google Scholar
[2]Bishop, E.. Foundations of Constructive Analysis. McGraw Hill: New York.Google Scholar
[3]Hachem, B.. Sur le théorème ergodique sur-stationnaire et sous-additif dans L p (l≤p≤∞). C.R. Acad. Sc. Paris 292, I (1981), 837–840.Google Scholar
[4]Kamae, T.Krengel, U. & O'Brien, G.. Stochastic inequalities in partially ordered spaces. Ann. of Prob. 5, 6 (1977), 899–912.CrossRefGoogle Scholar
[5]Kingman, J. F. C.. Subadditive ergodic theory. Ann. of Prob. 1, 883–909.Google Scholar
[6]Krengel, U.. Un théorème ergodique pour les processus sur-stationnaires. C R Acad. Sc. Paris. 282, A (1976) 1019–1021.Google Scholar
[7]Smeltzer, M. D.. The subadditive ergodic theorem. Ph.D. Thesis. Yale University, 1976.Google Scholar