Hostname: page-component-7479d7b7d-qlrfm Total loading time: 0 Render date: 2024-07-12T08:43:29.161Z Has data issue: false hasContentIssue false

More predictable, less predictable and stable counting processes

Published online by Cambridge University Press:  14 July 2016

Nader Ebrahimi*
Affiliation:
Northern Illinois University
*
Postal address: Division of Statistics, Northern Illinois University, DeKalb, IL 60115–2854, USA.

Abstract

In a counting process considered at time t the focus is often on the length of the current interarrival time, whereas points in the past may be said to constitute information about the process. The paper introduces new concepts on how to quantify predictability of the future behavior of counting processes based on the past information and considers then situations in which the future points become more (or less) predictable. Various properties of our proposed concepts are studied and applications relevant to the reliability of repairable systems are given.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1993 

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

Ascher, H. and Feingold, H. (1984) Repairable Systems Reliability. Dekker, New York.Google Scholar
Cox, D. R. and Miller, H. D. (1965) The Theory of Stochastic Process. Methuen, London.Google Scholar
Ebrahimi, N. (1990) Ordering of repairable systems. J. Appl. Prob. 27, 193201.CrossRefGoogle Scholar
Kapur, J. N. (1989) Maximum Entropy Models in Science and Engineering. Wiley, New York.Google Scholar
Marshall, A. W. and Olkin, I. (1979) Inequalities: Theory of Majorization and its Applications. Academic Press, New York.Google Scholar
Ross, S. M. (1983) Stochastic Processes. Wiley, New York.Google Scholar